Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Eq. (11) — closed form of the cost per period aα(x∣s,S)a_\alpha(x \mid s, S)aα​(x∣s,S) of a stationary (s,S)(s, S)(s,S) policy

Proved
VeinottWagnerSS.RenewalCost.eq11_aCost_closed_form

by mikedeng1 · Sep 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

inventoryp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1renewal-theoryss-policy

Let the demands be i.i.d. with distribution φ\varphiφ on {0,1,… }\{0, 1, \dots\}{0,1,…}, let 0≤α<10 \le \alpha < 10≤α<1 be the discount factor, K≥0K \ge 0K≥0 the set-up cost and Gα:Z→RG_\alpha : \mathbb Z \to \mathbb RGα​:Z→R the one-period cost, and let s≤Ss \le Ss≤S be integers with D=S−sD = S - sD=S−s. Let aα(x)=(1−α)f(x∣s,S)a_\alpha(x) = (1 - \alpha) f(x \mid s, S)aα​(x)=(1−α)f(x∣s,S) be the equivalent cost per period of the stationary (s,S)(s, S)(s,S) policy started from stock xxx, where fff is its total expected discounted cost. Then

aα(x)={Lα(S,D)+K1+Mα(D)x<s,(1−α)Lα(x,x−s)+Lα(S,D)+K1+Mα(D) rα(x−s)x≥s,a_\alpha(x) = \begin{cases} \dfrac{L_\alpha(S, D) + K}{1 + M_\alpha(D)} & x < s, \\[2ex] (1 - \alpha) L_\alpha(x, x - s) + \dfrac{L_\alpha(S, D) + K}{1 + M_\alpha(D)}\, r_\alpha(x - s) & x \ge s, \end{cases}aα​(x)=⎩⎨⎧​1+Mα​(D)Lα​(S,D)+K​(1−α)Lα​(x,x−s)+1+Mα​(D)Lα​(S,D)+K​rα​(x−s)​x<s,x≥s,​

with LαL_\alphaLα​ given by (7), MαM_\alphaMα​ the discount renewal function and rα(d)=E[αT(d)]r_\alpha(d) = E[\alpha^{T(d)}]rα​(d)=E[αT(d)].

This is the criterion minimized by the paper's algorithm for computing an optimal (s,S)(s, S)(s,S) policy (Section 4).

Formalization Note The model is the paper's reduced model (Eq. (2)): unit purchase cost 000 and one-period cost GαG_\alphaGα​. fff is the expected cost of the controlled Markov chain, not a closed form. LαL_\alphaLα​ and rαr_\alpharα​ are defined by their series ((7) and the first line of (9)). x−sx - sx−s and DDD are passed as natural numbers via toNat. The paper's standing assumptions that GαG_\alphaGα​ is convex and tends to +∞+\infty+∞ at ±∞\pm\infty±∞ are not assumed; for α<1\alpha < 1α<1 the identity holds for every GαG_\alphaGα​.

Preamble
import Mathlib
import Definitions.Def_VeinottWagnerSS_RenewalCost_Demand
import Definitions.Def_VeinottWagnerSS_RenewalCost_RenewalFunctions
import Definitions.Def_VeinottWagnerSS_RenewalCost_PolicyCost
Formal statement
namespace VeinottWagnerSS.RenewalCost

/-- Veinott & Wagner (1965), Eq. (11), p. 534: for `0 ≤ α < 1`, `K ≥ 0`, integers `s ≤ S` and
`D = S − s`, the equivalent cost per period `a_α(x) = (1 − α) f(x | s, S)` of the stationary
`(s, S)` policy is
`a_α(x) = (L_α(S, D) + K)/(1 + M_α(D))` for `x < s` and
`a_α(x) = (1 − α) L_α(x, x − s) + [(L_α(S, D) + K)/(1 + M_α(D))] r_α(x − s)` for `x ≥ s`. -/
theorem eq11_aCost_closed_form (D : DemandDist) (α K : ℝ) (hα0 : 0 ≤ α) (hα1 : α < 1)
    (hK : 0 ≤ K) (G : ℤ → ℝ) (s S : ℤ) (hsS : s ≤ S) (x : ℤ) :
    aCost D α K G s S x =
      if x < s then
        (LAlpha D.φ α G S (S - s).toNat + K) / (1 + MAlpha D.φ α (S - s).toNat)
      else
        (1 - α) * LAlpha D.φ α G x (x - s).toNat
          + (LAlpha D.φ α G S (S - s).toNat + K) / (1 + MAlpha D.φ α (S - s).toNat)
            * rAlpha D.φ α (x - s).toNat := by sorry

end VeinottWagnerSS.RenewalCost
Source
Veinott & Wagner, Computing Optimal (s, S) Inventory Policies, Management Sci. 11 (1965), p. 534, Eq. (11)
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me