Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sect. 13.2.4.3: balanced ordering, Var[Qb]=Nσ2+μ2k(R−k)\mathrm{Var}[Q^b] = N\sigma^2 + \mu^2k(R-k)Var[Qb]=Nσ2+μ2k(R−k) for N=MR+kN = MR + kN=MR+k

Proved
SupplyChainTheory.batch_balanced_ordering

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

bullwhip-effectoperations-researchprobabilitysupply-chain

Suppose the retailers' orders are spread evenly over the RRR-period interval: writing N=MR+kN = MR + kN=MR+k with 0≤k<R0 \le k < R0≤k<R, kkk of the RRR daily groups have M+1M + 1M+1 retailers and the other R−kR - kR−k have MMM, so the number of retailers ordering on a given day is X=M+1X = M + 1X=M+1 with probability k/Rk/Rk/R and X=MX = MX=M with probability 1−k/R1 - k/R1−k/R. Then the total order QtbQ^b_tQtb​ received by the supplier satisfies

E[Qtb]=Nμ,Var[Qtb]=Nσ2+μ2k(R−k)  ≥  Nσ2,\mathbb{E}[Q^b_t] = N\mu, \qquad \mathrm{Var}[Q^b_t] = N\sigma^2 + \mu^2 k(R-k) \;\ge\; N\sigma^2,E[Qtb​]=Nμ,Var[Qtb​]=Nσ2+μ2k(R−k)≥Nσ2,

with equality when k=0k = 0k=0, that is when exactly the same number of retailers orders on each day. Balancing is the mildest of the three patterns and is the strategy the book recommends when batching cannot be avoided.

Preamble
import Definitions.Def_SupplyChainTheory_bullwhip
Formal statement
namespace SupplyChainTheory

theorem batch_balanced_ordering {Ω : Type*} [MeasurableSpace Ω] {P : MeasureTheory.Measure Ω}
    [MeasureTheory.IsProbabilityMeasure P] {N R : ℕ} {mu sigma : ℝ} (hR : 0 < R)
    (B : BatchOrders P N R mu sigma) (M k : ℕ) (hk : k < R) (hN : N = M * R + k)
    (hXM : P.real {ω | B.X ω = M} = 1 - k / R)
    (hXM1 : P.real {ω | B.X ω = M + 1} = k / R) :
    (∫ ω, B.supplierOrder ω ∂P) = N * mu
      ∧ ProbabilityTheory.variance B.supplierOrder P
          = N * sigma ^ 2 + mu ^ 2 * k * (R - k) := by sorry

end SupplyChainTheory
Source
Lawrence V. Snyder and Zuo-Jun Max Shen, Fundamentals of Supply Chain Theory, 2nd ed., Wiley 2019, DOI 10.1002/9781119584445, pp. 550-551, Sect. 13.2.4.3 'Balanced Ordering'
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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