DFR retailer bound (proof of Theorem D.1, Steps 1-3):
ProvedOWMR.dfr_retailer_boundapproximation-algorithmsinventoryinventory-theoryoperations-researchrenewal-theorystochastic-control
Fix a network under the standing assumptions, a weight , choices satisfying IsDFRChoice N θ c (Definition D.1), and a retailer with and whose demand is DFR conditional on positive demand (DFRPositive) if . Then , and the augmented cost of the selected retailer policy satisfies
where (ssAvgCost) is the long-run average cost of the policy with setup cost per order and cost of the post-order position, is its long-run average mirror loss at center , and .
This is the per-retailer bound established in Steps 1-3 of the proof of Theorem D.1.
Preamble
import Definitions.Def_owmr_dfr_policy open scoped ENNReal
Formal statement
namespace OWMR
theorem dfr_retailer_bound {n : ℕ} (N : Network n) (hN : N.Standing) (θ : ℝ) (hθ0 : 0 < θ)
(hθ1 : θ ≤ 1) (c : FIFOChoice n) (hc : IsDFRChoice N θ c) (i : Fin n)
(hH : N.h ≤ N.H i) (hp : N.h ≤ N.p) (hD : 0 < N.K i → N.DFRPositive i) :
c.s i ≤ c.S i ∧
ssAvgCost (N.marginal i) (N.F i) (N.K i) (c.s i) (c.S i)
+ mirrorAvg (N.marginal i) N.h N.p (c.s i) (c.S i) (c.a i)
≤ ENNReal.ofReal (1 + θ * dfrLambda) * N.J i (N.K i / θ) := 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 D, proof of Theorem D.1, Steps 1-3 and (D.5)-(D.6), pp. E.25-E.27, with Definition D.1 (DFR Policy), p. E.23.