Lemma C.6 (local cost comparison): the two numerical inequalities behind
ProvedOWMR.arb_local_comparisonapproximation-algorithmsinventoryinventory-theoryoperations-researchrenewal-theorystochastic-control
Let and put , , , and , as in (33). For every real , with
- if , then ;
- if , then .
These are the two branches of the comparison in Lemma C.6 (half window when the setup share is at most , the canonical optimum otherwise).
Preamble
import Definitions.Def_owmr_consolidation_policy open scoped ENNReal
Formal statement
namespace OWMR
theorem arb_local_comparison (m : ℝ) (hm : 1 ≤ m) (u : ℝ) :
(0 ≤ u → u ≤ conU m →
1 + 7 * (1 + 1 / m) / 16 + (14 / (3 * conZeta m) - 1) * u
+ 3 / 8 * ((1 - u) / (1 - u / (conZeta m * (conB m - 1 + u)))) ≤ conB m) ∧
(conU m ≤ u → u ≤ 1 →
1 + 7 * (1 + 1 / m) / 8 + (7 / (3 * conZeta m) - 1 - 7 * (1 / m) / 12) * u
+ 3 / 8 * ((1 - u) / (1 - u / (conZeta m * (conB m - 1 + u)))) ≤ conB m) := 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 6, Lemma C.6 with (C.24)-(C.28), pp. E.18-E.20; parameters (33), p. 27.