Sec. 2.3, p. 7 — g > 0 and OPT(L) ≥ g
ProvedLostSalesExpGap.ConstOrder.g_pos_opt_ge_glost-saleslower-boundnewsvendorp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
In the lost-sales model (i.i.d. nonnegative demand with finite mean and strictly positive variance, lead time , costs , empty initial state), let
be the optimal single-period newsvendor cost. Then and .
The lower bound converts the additive bound on into the ratio bound of Theorem 1.
Formalization Note is the infimum over all measurable history-dependent, possibly randomized policies, a class containing the paper's ; the bound is therefore at least as strong as printed. It is compared with in .
Preamble
import Mathlib import Definitions.Def_LostSalesExpGap_ConstOrder_ConstantOrder open MeasureTheory ProbabilityTheory open scoped ENNReal NNReal BigOperators
Formal statement
namespace LostSalesExpGap.ConstOrder
/-- Sec. 2.3, p. 7: `g > 0` and `OPT(L) ≥ g`. -/
theorem g_pos_opt_ge_g (P : CappedBaseStock.DemandLaw) (c : CappedBaseStock.Parameters)
(hP : LostSalesConstantOrder.LargeLeadTime.NonDeterministic P) :
0 < gNV P c ∧ ENNReal.ofReal (gNV P c) ≤ CappedBaseStock.OPT P c := by sorry
end LostSalesExpGap.ConstOrder
Source
Xin, Goldberg, Optimality gap of constant-order policies decays exponentially in the lead time for lost sales models, arXiv:1409.1499v2, Sec. 2.3, p. 7
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.