Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6.1 — the triple-balancing policy is a 3-approximation for stochastic lot-sizing

Proved
LeviBalancing.TripleBalancing.triple_balancing_three_approximation

by mikedeng1 · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximation-algorithminventory-controlp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-lot-sizing

Consider an instance of the stochastic lot-sizing problem: TTT periods, a fixed ordering cost K≥0K\ge0K≥0, holding costs ht≥0h_t\ge0ht​≥0, backlogging penalties pt≥0p_t\ge0pt​≥0, an initial inventory level x1x_1x1​, and nonnegative, arbitrarily correlated demands DtD_tDt​ with conditional demand law III, where the demand of each period is known at the beginning of that period. Let TB be the triple-balancing policy. Then for every feasible (nonanticipatory) policy PPP,

E[C(TB)]≤3 E[C(P)].E[\mathcal C(TB)]\le 3\,E[\mathcal C(P)].E[C(TB)]≤3E[C(P)].

In particular the expected cost of the triple-balancing policy is at most three times the expected cost of an optimal policy. This is the paper's constant-factor guarantee for the stochastic lot-sizing problem, where computing an optimal policy is intractable in general.

Formalization Note The paper compares TB with "an optimal policy"; the statement is for every feasible policy, which implies the paper's whenever an optimal policy exists and needs no existence assumption. Expected costs are lower Lebesgue integrals in [0,∞][0,\infty][0,∞]. The statement quantifies over every policy satisfying the triple-balancing rules; such a policy exists when hT>0h_T>0hT​>0 (separate theorem).

Preamble
import Mathlib
import Definitions.Def_LeviBalancing_TripleBalancing_Model
import Definitions.Def_LeviBalancing_TripleBalancing_Policy
import Definitions.Def_LeviBalancing_TripleBalancing_TBPolicy

open MeasureTheory ProbabilityTheory
Formal statement
namespace LeviBalancing.TripleBalancing

/-- Theorem 6.1 (p. 301): the expected cost of the triple-balancing policy is at most three times
the expected cost of any feasible policy (in particular, of an optimal one). -/
theorem triple_balancing_three_approximation {Ω : Type*} [MeasurableSpace Ω]
    (M : LotSizingModel Ω) (I : ℕ → Kernel Ω (ℕ → ℝ)) (hI : M.IsCondDemandLaw I)
    (TB : ℕ → Ω → ℝ) (hTB : IsTripleBalancing M I TB)
    (P : ℕ → Ω → ℝ) (hP : IsFeasiblePolicy M P) :
    expectedCost M TB ≤ 3 * expectedCost M P := by sorry

end LeviBalancing.TripleBalancing
Source
Levi, Pál, Roundy & Shmoys, Approximation Algorithms for Stochastic Inventory Control Models, Math. Oper. Res. 32(2):284–302 (2007), DOI 10.1287/moor.1060.0205, p. 301 (PDF 18), Theorem 6.1
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 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