Theorem 1: the guarantee for classical policies
ProvedTwoStageRnQ.five_thirds_guaranteeinventoryoperations-research
Theorem 1 (the guarantee). For every instance and every demand environment,
the same with , and for the bound is attained by a finite deterministic classical rule.
Preamble
import Definitions.Def_TwoStageRnQ_Model
Formal statement
namespace TwoStageRnQ
theorem five_thirds_guarantee (P : Params) (S : DemandSpace P) :
(⨅ c : ClassicalControls, classicalLotCost P S c) ≤ ENNReal.ofReal (5 / 3 * P.Ltwo) ∧
(⨅ c : ClassicalControls, classicalShipCost P S c) ≤ ENNReal.ofReal (5 / 3 * P.Ltwo) ∧
P.Ltwo ≤ P.LBsp ∧
ENNReal.ofReal P.LBsp ≤ OPTsh P ∧
OPTsh P ≤ OPTlot P ∧
(0 < P.lam → 0 < P.h1 → 0 < P.h2 → 0 < P.p →
∃ c : ClassicalControls, c.1.2.2.2.2 = 0 ∧
classicalLotCost P S c ≤ ENNReal.ofReal (5 / 3 * P.Ltwo)) := by sorry
end TwoStageRnQ
Source
M. Hu, "A 5/3 Guarantee for Echelon Stock (R,nQ) Policies in Two-Stage Stochastic Serial Systems", manuscript rq_167.tex (Sept. 28, 2026 version); posted as arXiv:2609.06318. Theorem 1, eq. (20).
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.