Section 4.5 and eq. (I.1): the two bounds behind tightness of
ProvedLostSalesRQ.tightness_boundsapproximation-guaranteeinventorylost-salesoperations-research
- For every and , an equally spaced unit-ordering policy shows
- If and , then every integer base-stock level satisfies
Along these give , so the factor cannot be improved for ordinary base stock.
Preamble
import Definitions.Def_LostSalesRQ_model
Formal statement
namespace LostSalesRQ
theorem tightness_bounds :
(∀ μ a : ℝ, 0 ≤ μ → 1 / 2 < a → OPTk μ a 0 ≤ ENNReal.ofReal (Real.sqrt (2 * a))) ∧
(∀ μ a : ℝ, 0 < a → a < μ → ∀ j : ℕ,
2 * Real.sqrt (a * (1 - a / μ)) - (1 - a / μ) ≤ baseStockCost μ a j) := 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.5 (pp. 20-21); Appendix I, eq. (I.1) and the following display (pp. A19-A20).
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.