Two-candidate comparison:
ProvedOWMR.fifo_candidate_comparisonThis is the two-candidate comparison of Proposition 1, in the sharper form that Step 1 of the proof of Theorem 1 uses.
Consider an OWMR network that satisfies the standing assumptions and a retailer with , , and setup cost . Let be a canonical optimum of retailer 's single-location problem at planning setup cost , with width , and let be a half window of , of width , with the smallest average holding and backlog cost. Write for the augmented cost of the policy at the actual setup cost : its long-run average cost in retailer 's single-location problem plus its mirror cost. Then, with ,
Dividing by , this reads with . With it gives the factor of Proposition 1, and with the canonical width bound it gives the retailer comparison in the proof of Theorem 1.
Formalization Note The augmented cost is N.augCost. The half window is given by IsBestHalfWindow, which selects the half window with the smallest average holding and backlog cost, equivalently the largest retained savings.
import Definitions.Def_owmr_single_location open scoped ENNReal
namespace OWMR
theorem fifo_candidate_comparison {n : ℕ} (N : Network n) (hN : N.Standing) (i : Fin n)
(hH : N.h ≤ N.H i) (hp : N.h ≤ N.p) (hK : 0 < N.K i) (sh Sh s' S' : ℝ)
(hcan : IsCanonicalOptimum (N.marginal i) (N.F i) (5 * N.K i / 3) sh Sh)
(hhalf : IsBestHalfWindow (N.marginal i) (N.F i) sh Sh s' S') :
min (N.augCost i sh Sh) (N.augCost i s' S')
≤ N.J i (5 * N.K i / 3) + ENNReal.ofReal (N.h * N.p / (N.h + N.p) * (Sh - sh) / 2) := by sorry
end OWMR