Shared-cost lower bound (Proposition 3)
ProvedOWMR.shared_cost_lower_boundThis is the shared-cost lower bound (Proposition 3 of the source).
Consider an OWMR network that satisfies the standing assumptions and in which every retailer's holding rate is at least the warehouse rate, for all , and let be a valid initial state. Then for every real ,
Here is the optimal average cost of the supplier's single-location problem (aggregate demand, cost , setup cost ), is that of retailer (its own demand, cost , setup cost ), and is the infimum of the long-run average expected cost over all nonanticipative feasible policies from , including history-dependent and randomized ones.
The bound splits copies of the physical cost between one pooled supplier problem and copies of each retailer problem. It is the lower half of the proof of Theorem 1, and the source also compares the consolidation policy with it in the proof of Theorem 2.
Formalization Note Costs are extended nonnegative reals; the factors and enter through ENNReal.ofReal.
import Definitions.Def_owmr_single_location open scoped ENNReal
namespace OWMR
theorem shared_cost_lower_bound {n : ℕ} (N : Network n) (hN : N.Standing)
(hH : ∀ i, N.h ≤ N.H i) (x : InitState n) (hx : x.Valid) (γ : ℝ) (hγ : 1 < γ) :
N.J0 (γ * N.K0) + ENNReal.ofReal (γ - 1) * ∑ i, N.J i (γ * N.K i / (γ - 1))
≤ ENNReal.ofReal γ * OPT N x := by sorry
end OWMR