The two certificate constraints bound scan overload
ProvedCappedBaseStock.scan_excess_certificate_boundcapped-base-stockinventorylost-salesoperations-research
Let demand be i.i.d. and nonnegative with finite positive mean , and let . For a demand block define
Suppose , , and the two certificate constraints hold:
For , the scan overload satisfies
This is a demand-only inequality: it does not presume any stationary inventory distribution or policy cost comparison. Both horizon constraints are retained. It supplies the explicit scan estimate used in the ordinary-base-stock loss bound.
Preamble
import Definitions.Def_CappedBaseStock_BaseStockAnalysis open MeasureTheory open scoped ENNReal
Formal statement
namespace CappedBaseStock
theorem scan_excess_certificate_bound (P : DemandLaw) (c : Parameters) (r z : ℝ)
(feasible : CertificateFeasible P c r z) :
(∫⁻ d, scanExcess d c.L (((c.L : ℝ) + 1) * r + 2 * z) ∂demandPathLaw P) ≤
ENNReal.ofReal ((2 * (c.L : ℝ) + 1) * (mean P - r)) := by sorry
end CappedBaseStock
Source
Linwei Xin, Capped Base-Stock Policies: A 2.33-Approximation, author-supplied LaTeX manuscript (756 lines), SHA-256 f353793c255e1ebed5f3ec541037284bd926183e3e5b71941f13e79c2d67cb7a. Public paper listing: https://papers.ssrn.com/sol3/papers.cfm?abstract_id=7134538. Proof of Lemma `lem-base-stock-loss`, lines 585–609: the suffix/prefix maxima, equation `eq-12`, and the concluding expected scan-excess inequality. The scan is translated to zero-based demand coordinates without changing its law.