Proposition 1: committed-supply lower bound
ProvedLostSalesRQ.committed_supply_lower_boundapproximation-guaranteeinventorylost-salesoperations-research
For every lead-time demand mean , every lost-sales penalty and every rank weight , the zero-setup optimal cost satisfies
The bound holds against every admissible policy, including history-dependent and randomized ones, and makes a computable lower bound on the optimal cost.
Formalization Note The left side is in and the right side is embedded by ENNReal.ofReal, so a negative right side gives the trivial bound , as in the paper.
Preamble
import Definitions.Def_LostSalesRQ_model import Definitions.Def_LostSalesRQ_lower_curve
Formal statement
namespace LostSalesRQ
theorem committed_supply_lower_bound (μ a η : ℝ) (hμ : 0 ≤ μ) (ha : 0 ≤ a) (hη : 1 ≤ η) :
ENNReal.ofReal (min (rankBound μ η) (a - agingRateSup μ η)) ≤ OPTk μ a 0 := 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; Proposition 1, eq. (10) (p. 13); proof in Appendix B (pp. A4-A5).
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.