Canonical width bound:
ProvedOWMR.canonical_width_boundapproximation-algorithmsinventoryinventory-theoryoperations-researchstochastic-control
This is the canonical width bound in Step 2 of the proof of Lemma 3, which is also the first inequality of (31).
Consider an OWMR network that satisfies the standing assumptions, a retailer , and a setup cost . Let be a canonical optimum of retailer 's single-location problem at setup cost : , the policy attains , , and on . Then, with and the width ,
When the coefficient is at most , which gives the bound of Lemma 3; when and it is at most , as used in (31).
Formalization Note The canonical optimum is IsCanonicalOptimum; the coefficient enters through ENNReal.ofReal.
Preamble
import Definitions.Def_owmr_single_location open scoped ENNReal
Formal statement
namespace OWMR
theorem canonical_width_bound {n : ℕ} (N : Network n) (hN : N.Standing) (i : Fin n)
(k sh Sh : ℝ) (hcan : IsCanonicalOptimum (N.marginal i) (N.F i) k sh Sh) :
ENNReal.ofReal (N.h * N.p / (N.h + N.p) * (Sh - sh))
≤ ENNReal.ofReal (N.h * (N.H i + N.p) / (N.H i * (N.h + N.p))) * N.J i k := 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), Lemma 3 (Canonical Savings and Width), Step 2 of its proof, pp. 14-15, and the first inequality of eq. (31) in Section 5.4, p. 26.