Section 4.3.3: exact optimal cost for and for
ProvedLostSalesRQ.exact_boundary_casesapproximation-guaranteeinventorylost-salesoperations-research
- If and , then no replenishment is optimal and
- If (immediate replenishment) and , then
These boundary cases reduce the comparison to and , and the equality at starts the interval comparisons.
Preamble
import Definitions.Def_LostSalesRQ_model import Definitions.Def_LostSalesRQ_lower_curve
Formal statement
namespace LostSalesRQ
theorem exact_boundary_cases :
(∀ μ a : ℝ, 0 ≤ μ → 0 ≤ a → a ≤ 1 →
lowerCurve μ a = a ∧ OPTk μ a 0 = ENNReal.ofReal a ∧ minBaseStockCost μ a = a) ∧
(∀ a : ℝ, 0 ≤ a →
lowerCurve 0 a = min a 1 ∧ minBaseStockCost 0 a = min a 1 ∧
OPTk 0 a 0 = ENNReal.ofReal (min a 1)) := 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.3.3, the two displays at the end of the subsection (p. 16).
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.