Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 9.5: the optimal base-stock level with disruptions is S∗=d+d F−1(p/(p+h))S^* = d + d\,F^{-1}(p/(p+h))S∗=d+dF−1(p/(p+h))

Proved
SupplyChainTheory.disruption_base_stock

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

base-stockinventorynewsvendoroperations-researchsupply-uncertainty

Theorem 9.5. In the infinite-horizon newsvendor problem with deterministic demand d>0d > 0d>0 per period and supply disruptions with disruption probability α\alphaα and recovery probability β\betaβ (0<α,β≤10 < \alpha, \beta \le 10<α,β≤1), holding cost h>0h > 0h>0 and backorder cost p>0p > 0p>0, the optimal base-stock level is

S∗  =  d+d F−1(pp+h),S^* \;=\; d + d\,F^{-1}\Big(\frac{p}{p+h}\Big),S∗=d+dF−1(p+hp​),

where FFF is the distribution function (9.10) of the disruption length and F−1(γ)F^{-1}(\gamma)F−1(γ) is the smallest nnn with F(n)≥γF(n) \ge \gammaF(n)≥γ. Formally, for the kkk with F(k)≥p/(p+h)F(k) \ge p/(p+h)F(k)≥p/(p+h) and F(n)<p/(p+h)F(n) < p/(p+h)F(n)<p/(p+h) for all n<kn < kn<k, the level d+dkd + dkd+dk minimizes ggg and is its least minimizer.

The book's derivation: the finite difference Δg(S)=g(S+d)−g(S)\Delta g(S) = g(S+d) - g(S)Δg(S)=g(S+d)−g(S) at a multiple SSS of ddd equals d[(h+p)F(S/d−1)−p]d[(h+p)F(S/d - 1) - p]d[(h+p)F(S/d−1)−p], so S∗S^*S∗ is the smallest multiple of ddd at which this is nonnegative. The formula mirrors the demand-uncertainty newsvendor solution S∗=μ+σΦ−1(p/(p+h))S^* = \mu + \sigma\Phi^{-1}(p/(p+h))S∗=μ+σΦ−1(p/(p+h)): ddd is cycle stock, dF−1(γ)dF^{-1}(\gamma)dF−1(γ) is safety stock protecting against disruptions of up to F−1(γ)F^{-1}(\gamma)F−1(γ) periods, and γ\gammaγ is the type-1 service level. In Example 9.3, γ=0.9231\gamma = 0.9231γ=0.9231, F−1(γ)=3F^{-1}(\gamma) = 3F−1(γ)=3 and S∗=8000S^* = 8000S∗=8000.

Preamble
import Definitions.Def_SupplyChainTheory_disruptions
Formal statement
namespace SupplyChainTheory

theorem disruption_base_stock (α β h p d : ℝ) (hα0 : 0 < α) (hα1 : α ≤ 1) (hβ0 : 0 < β)
    (hβ1 : β ≤ 1) (hh : 0 < h) (hp : 0 < p) (hd : 0 < d) (k : ℕ)
    (hk : p / (p + h) ≤ disruptionCdf α β k) (hk' : ∀ n < k, disruptionCdf α β n < p / (p + h)) :
    IsMinOn (meanCost α β h p d) Set.univ (d + d * k)
      ∧ ∀ S, IsMinOn (meanCost α β h p d) Set.univ S → d + d * k ≤ S := 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. 363-364, Sect. 9.2.2.4, Theorem 9.5, Eq. (9.15)-(9.18) and the derivation of ∆g(S); after Tomlin (2006)
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