Eq. (23): cost of batching the selected base-stock policy
ProvedLostSalesRQ.batching_upper_boundapproximation-guaranteeinventorylost-salesoperations-research
Fix , , , an integer base-stock level and a demand environment of rate one, and let , . Every policy following the rule satisfies
The surcharge is the extra inventory from traversing inventory positions and spreads the setup charge over a lot, the same tradeoff as in the EOQ formula.
Preamble
import Definitions.Def_LostSalesRQ_model
Formal statement
namespace LostSalesRQ
theorem batching_upper_bound (μ a k : ℝ) (hμ : 0 ≤ μ) (ha : 0 ≤ a) (hk : 0 ≤ k)
(S : DemandSpace 1) (j : ℕ) (hj : 1 ≤ j) (π : Policy S)
(hπ : IsRQPolicy μ (j - 1) (lotSize k) π) :
π.avgCost μ 1 a k ≤ ENNReal.ofReal (baseStockCost μ a j + batchSurcharge k) ∧
batchSurcharge k ≤ Real.sqrt (2 * k) := by sorry
end LostSalesRQSource
M. Hu, "A 1.932 Guarantee for (r,Q) Policies in Continuous-Review Lost-Sales Inventory Systems", arXiv:2610.34576, 2026; Section 4.6.1, eq. (23) (p. 21); Appendix J.2 (pp. A22-A24).
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.