Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, (6), p. 656 — c(s − 1, S) is a weighted average of c(s, S) and G(s)

Proved
ZhengFedergruenSS.Algorithm.eq6_weighted_average

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

inventoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1renewal-theorys-s-policy

In the model of Zheng and Federgruen (demand law with p0<1p_0<1p0​<1, fixed cost K>0K>0K>0, −G-G−G unimodal, the growth condition), let αn=M(n)/M(n+1)\alpha_n=M(n)/M(n+1)αn​=M(n)/M(n+1). For integers s<Ss<Ss<S and n=S−sn=S-sn=S−s,

0<αn≤1,c(s−1,S)=αn c(s,S)+(1−αn) G(s).0<\alpha_n\le 1,\qquad c(s-1,S)=\alpha_n\,c(s,S)+(1-\alpha_n)\,G(s).0<αn​≤1,c(s−1,S)=αn​c(s,S)+(1−αn​)G(s).

So lowering the reorder level by one moves the cost toward G(s)G(s)G(s). This identity underlies Lemma 0 and through it every comparison the algorithm makes.

Formalization Note. αn=1\alpha_n=1αn​=1 is possible: it happens when m(n)=0m(n)=0m(n)=0, e.g. for demand concentrated on {0,2}\{0,2\}{0,2}. The upper bound is therefore weak, as printed.

Preamble
import Mathlib
import Definitions.Def_VeinottWagnerSS_RenewalCost_Demand
import Definitions.Def_ZhengFedergruenSS_Algorithm_Model
Formal statement
namespace ZhengFedergruenSS.Algorithm

/-- Display (6), §2, p. 656 (Zheng and Federgruen 1991): with `α_n = M(n)/M(n + 1)`,
`0 < α_n ≤ 1` and, for `s < S` and `n = S − s`,
`c(s − 1, S) = α_n c(s, S) + (1 − α_n) G(s)`.

Formalization Note: `α_n` may equal `1` (when `m(n) = 0`, e.g. for demand concentrated on
`{0, 2}`), so the upper bound is weak, as printed. -/
theorem eq6_weighted_average (D : VeinottWagnerSS.RenewalCost.DemandDist) (hp0 : D.φ 0 < 1)
    (K : ℝ) (hK : 0 < K) (G : ℤ → ℝ) (hG : NegUnimodal G) (hgrowth : GrowthCond K G)
    (s S : ℤ) (hsS : s < S) :
    0 < alpha D.φ (S - s).toNat ∧ alpha D.φ (S - s).toNat ≤ 1 ∧
      c D.φ K G (s - 1) S =
        alpha D.φ (S - s).toNat * c D.φ K G s S + (1 - alpha D.φ (S - s).toNat) * G s := by sorry

end ZhengFedergruenSS.Algorithm
Source
Zheng and Federgruen, Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy, Oper. Res. 39(4):654–665 (1991), DOI 10.1287/opre.39.4.654, p. 656, §2, (6)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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