Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Retailer budgets of πcon\pi_{\rm con}πcon​: immediate and batch retailers (Steps 5 and 6)

Proved
OWMR.con_retailer_budget

by Ming Hu · Nov 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximation-algorithmsinventoryinventory-theoryoperations-researchrenewal-theorystochastic-control

Let a network satisfy the standing assumptions, let m≥1m\ge1m≥1 with mh≤Himh\le H_imh≤Hi​ for all iii and h≤ph\le ph≤p, and let ccc satisfy Definition 2. Write ki=ζmKik_i=\zeta_mK_iki​=ζm​Ki​, Gi=Ji(ki)G_i=J_i(k_i)Gi​=Ji​(ki​), wi=Si−siw_i=S_i-s_iwi​=Si​−si​, ψ(u)=max⁡(1−4u/3,0)2/(8/3)\psi(u)=\max(1-4u/3,0)^2/(8/3)ψ(u)=max(1−4u/3,0)2/(8/3), and ci(f;K)c_i(f;K)ci​(f;K) for the long-run average cost of retailer iii's (si,Si)(s_i,S_i)(si​,Si​) policy with setup cost KKK and cost fff of the post-order position. For each retailer iii:

  1. (immediate retailer) if iii is not a batch retailer, then si=Sis_i=S_isi​=Si​, SiS_iSi​ minimizes FiF_iFi​, and Fi(Si)+Ki≤BmGiF_i(S_i)+K_i\le B_mG_iFi​(Si​)+Ki​≤Bm​Gi​;
  2. (batch retailer) if iii is a batch retailer, then si<Sis_i<S_isi​<Si​ and
ci(Fi;73Ki)+ci(h(Si−⋅)+;0)+min⁡(38hwi, (h+p)wi ci(ψ((Si−⋅)/wi);0))+38h EDi≤BmGi.c_i\bigl(F_i;\tfrac73K_i\bigr)+c_i\bigl(h(S_i-\cdot)^+;0\bigr)+\min\Bigl(\tfrac38hw_i,\ (h+p)w_i\,c_i\bigl(\psi((S_i-\cdot)/w_i);0\bigr)\Bigr)+\tfrac38h\,\mathbb E D_i\le B_mG_i .ci​(Fi​;37​Ki​)+ci​(h(Si​−⋅)+;0)+min(83​hwi​, (h+p)wi​ci​(ψ((Si​−⋅)/wi​);0))+83​hEDi​≤Bm​Gi​.

The left side of item 2 is the long-run cost charged to a batch retailer: its own costs with 7/37/37/3 expected dispatches per order, the reserve it holds, the warehouse width cost, and its share of the trigger cost.

Preamble
import Definitions.Def_owmr_consolidation_policy

open MeasureTheory
open scoped ENNReal NNReal
Formal statement
namespace OWMR
theorem con_retailer_budget {n : ℕ} (N : Network n) (hN : N.Standing) (m : ℝ) (hm : 1 ≤ m)
    (hH : ∀ i, m * N.h ≤ N.H i) (hp : N.h ≤ N.p) (c : ConChoice n) (hc : IsConChoice N m c)
    (i : Fin n) :
    (c.batch i = false → c.s i = c.S i ∧ (∀ y, N.F i (c.S i) ≤ N.F i y) ∧
      ENNReal.ofReal (N.F i (c.S i) + N.K i)
        ≤ ENNReal.ofReal (conB m) * N.J i (conZeta m * N.K i)) ∧
    (c.batch i = true → c.s i < c.S i ∧
      ssAvgCost (N.marginal i) (N.F i) (7 / 3 * N.K i) (c.s i) (c.S i)
        + ssAvgCost (N.marginal i) (fun y => N.h * max (c.S i - y) 0) 0 (c.s i) (c.S i)
        + min (ENNReal.ofReal (N.h * (3 / 8) * (c.S i - c.s i)))
            (ENNReal.ofReal ((N.h + N.p) * (c.S i - c.s i))
              * ssAvgCost (N.marginal i)
                  (fun y => max (1 - 4 * ((c.S i - y) / (c.S i - c.s i)) / 3) 0 ^ 2 / (8 / 3)) 0
                  (c.s i) (c.S i))
        + ENNReal.ofReal (3 / 8 * N.h * ∫ x, (x : ℝ) ∂(N.marginal i))
      ≤ ENNReal.ofReal (conB m) * N.J i (conZeta m * N.K i)) := by sorry
end OWMR
Source
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 C, Steps 5 and 6, Lemmas C.5 and C.6 with (C.24)-(C.28), pp. E.16-E.20; retailer choice in Definition 2 (i), p. 27.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me