Consolidation upper bound:
ProvedOWMR.consolidation_upper_boundThis is the cost bound for the consolidation policy that the source states after Theorem 2 (Section 6) and proves in Appendix C.
Let , and set , , and . Consider an OWMR network that satisfies the standing assumptions, in which the retailer demands within each period are associated, for every retailer, and . Then from every valid initial state , for arbitrary nonnegative setup costs and all finite lead times, the deterministic consolidation policy of Definition 2 satisfies
where is the long-run average expected cost from , and and are the optimal average costs of the supplier's and retailer 's single-location problems with setup cost .
The right side is twice the left side of the shared-cost lower bound (Proposition 3) at , so this bound and Proposition 3 give Theorem 2 with the factor .
Formalization Note , , and are conG m, conZeta m, and conB m; costs are extended nonnegative reals.
import Definitions.Def_owmr_consolidation_policy open scoped ENNReal
namespace OWMR
theorem consolidation_upper_bound {n : ℕ} (hn : 0 < n) (N : Network n) (hN : N.Standing)
(hA : N.Associated) (m : ℝ) (hm : 1 ≤ m) (hH : ∀ i, m * N.h ≤ N.H i) (hp : N.h ≤ N.p)
(x : InitState n) (hx : x.Valid) (c : ConChoice n) (hc : IsConChoice N m c) :
(conPolicy N x c).avgCost N x
≤ 2 * N.J0 (conG m * N.K0) + ENNReal.ofReal (conB m) * ∑ i, N.J i (conZeta m * N.K i) := by sorry
end OWMR