Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 1 (selected policy): FIFO or consolidation, whichever applies, costs at most min{13/3+32/(57m), max{9/4+1/(4m), 1+K_max/K_0}} times OPT

Proved
OWMR.selected_policy

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

inventoryinventory-theoryoperations-researchrenewal-theorystochastic-control

Let NNN be a one-warehouse multi-retailer network with n≥1n\ge1n≥1 retailers under the standing assumptions of Section 3, with associated retailer demands in each period, Hi≥hH_i\ge hHi​≥h for every retailer and p≥hp\ge hp≥h. Set m=min⁡iHi/hm=\min_iH_i/hm=mini​Hi​/h, γm=9/4+1/(4m)\gamma_m=9/4+1/(4m)γm​=9/4+1/(4m) and γˉm=13/3+32/(57m)\bar\gamma_m=13/3+32/(57m)γˉ​m​=13/3+32/(57m). Fix a valid initial state, choices for πFIFO\pi_{\rm FIFO}πFIFO​ satisfying Definition 1 (IsFIFOChoice) and choices for πcon(m)\pi^{(m)}_{\rm con}πcon(m)​ satisfying Definition 2 with parameter mmm (IsConChoice N m).

  1. Corollary 1. If K0>0K_0>0K0​>0, the policy πselect\pi_{\rm select}πselect​ that uses πFIFO\pi_{\rm FIFO}πFIFO​ if 1+Kmax⁡/K0≤γˉm1+K_{\max}/K_0\le\bar\gamma_m1+Kmax​/K0​≤γˉ​m​ and πcon(m)\pi^{(m)}_{\rm con}πcon(m)​ otherwise satisfies C(πselect)≤min⁡{γˉm,max⁡{γm,1+Kmax⁡/K0}} OPTC(\pi_{\rm select})\le\min\{\bar\gamma_m,\max\{\gamma_m,1+K_{\max}/K_0\}\}\,\mathrm{OPT}C(πselect​)≤min{γˉ​m​,max{γm​,1+Kmax​/K0​}}OPT.
  2. The remark after Corollary 1. If K0=0K_0=0K0​=0, using πFIFO\pi_{\rm FIFO}πFIFO​ when Kmax⁡=0K_{\max}=0Kmax​=0 and πcon(m)\pi^{(m)}_{\rm con}πcon(m)​ otherwise gives the factors γm\gamma_mγm​ and γˉm\bar\gamma_mγˉ​m​, respectively.

Costs are long-run expected average costs from the given initial state, and OPT is the optimal such cost over all feasible nonanticipative policies, as in Theorems 1 and 2.

Preamble
import Definitions.Def_owmr_fifo_policy
import Definitions.Def_owmr_consolidation_policy

open scoped ENNReal
Formal statement
namespace OWMR
theorem selected_policy {n : ℕ} (hn : 0 < n) (N : Network n) (hN : N.Standing)
    (hA : N.Associated) (hH : ∀ i, N.h ≤ N.H i) (hp : N.h ≤ N.p)
    (m : ℝ) (hm : m = ⨅ i, N.H i / N.h)
    (x : InitState n) (hx : x.Valid) (cF : FIFOChoice n) (hcF : IsFIFOChoice N cF)
    (cC : ConChoice n) (hcC : IsConChoice N m cC) :
    (0 < N.K0 →
      (if 1 + N.Kmax / N.K0 ≤ 13 / 3 + 32 / (57 * m) then fifoPolicy N x cF
        else conPolicy N x cC).avgCost N x
      ≤ ENNReal.ofReal (min (13 / 3 + 32 / (57 * m))
          (max (9 / 4 + 1 / (4 * m)) (1 + N.Kmax / N.K0))) * OPT N x) ∧
    (N.K0 = 0 →
      (if N.Kmax = 0 then fifoPolicy N x cF else conPolicy N x cC).avgCost N x
      ≤ ENNReal.ofReal (if N.Kmax = 0 then 9 / 4 + 1 / (4 * m) else 13 / 3 + 32 / (57 * m))
        * OPT N x) := 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), Section 6, Corollary 1 (Selected Policy) and the remark after it on K_0 = 0, p. 30; it combines Theorem 1 (p. 10) and Theorem 2 (p. 29).
Human review
  • Endorsed by Shuze Chen · Nov 17, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Ming Hu · Nov 17, 2026

    Confirmed by the mission captain (proposal self-audit).

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