Lemma C.4: supplier cost, the stockout frequency , and the shift
ProvedOWMR.arb_supplier_shortageapproximation-algorithmsinventoryinventory-theoryoperations-researchrenewal-theorystochastic-control
Let , let a network satisfy the standing assumptions, let and , and let satisfy the requirements of Definition 2 (IsConChoice). Then there is such that , , , and
- ;
- ;
- ,
where is the long-run average cost of the supplier's policy on the aggregate demand. Item 3 bounds the long-run frequency of supplier stockouts over a lead time.
Preamble
import Definitions.Def_owmr_consolidation_policy open MeasureTheory open scoped ENNReal NNReal
Formal statement
namespace OWMR
theorem arb_supplier_shortage {n : ℕ} (hn : 0 < n) (N : Network n) (hN : N.Standing) (m : ℝ)
(hm : 1 ≤ m) (hhp : N.h ≤ N.p) (c : ConChoice n) (hc : IsConChoice N m c) :
∃ a0 : ℝ, 0 ≤ a0 ∧ c.s0 ≤ c.S0 ∧ 0 ≤ c.s0 ∧ N.J0 (conG m * N.K0) ≠ ∞ ∧
ssAvgCost N.aggregate N.fL0 N.K0 c.s0 c.S0
≤ N.J0 (conG m * N.K0) + ENNReal.ofReal (N.h * a0) ∧
ENNReal.ofReal (N.h * a0 + ⨅ y, N.fL0 y) ≤ N.J0 (conG m * N.K0) ∧
ssAvgCost N.aggregate (fun y => ((Measure.pi fun _ : Fin N.L0 => N.aggregate)
{w | y < ∑ j, (w j : ℝ)}).toReal) 0 c.s0 c.S0
≤ ENNReal.ofReal (N.h / (N.h + N.p)) := by sorry
end OWMRSource
M. Hu, "A 5/2 Guarantee for Echelon Stock (s,S) Policies in One-Warehouse Multi-Retailer Systems", working paper (manuscript of November 2026), Appendix C, Step 4, Lemma C.4 (i)-(iii) with (C.19)-(C.20), pp. E.14-E.16; supplier choice in Definition 2 (iv), p. 27.