Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6.3 (Clark-Scarf): the sequentially optimized echelon base-stock vector is optimal, with cost gN(SN∗)g_N(S^*_N)gN​(SN∗​)

Disproved
SupplyChainTheory.clark_scarf_sequential

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

base-stockdynamic-programmingmultiechelonoperations-researchsupply-chain

Theorem 6.3. Consider an NNN-stage serial system with echelon holding costs hj≥0h_j \ge 0hj​≥0, stockout cost p≥0p \ge 0p≥0 at stage 1 and lead-time demands DjD_jDj​ of finite mean. Let gˉ0(x)=(p+h1′)x−\bar g_0(x) = (p + h'_1)x^-gˉ​0​(x)=(p+h1′​)x− and, for j=1,…,Nj = 1, \dots, Nj=1,…,N,

g^j(x)=hjx+gˉj−1(x),gj(y)=E[g^j(y−Dj)],Sj∗=arg⁡min⁡ygj(y),gˉj(x)=gj(min⁡{Sj∗,x}).\hat g_j(x) = h_j x + \bar g_{j-1}(x), \qquad g_j(y) = \mathbb{E}[\hat g_j(y - D_j)], \qquad S^*_j = \arg\min_y g_j(y), \qquad \bar g_j(x) = g_j(\min\{S^*_j, x\}).g^​j​(x)=hj​x+gˉ​j−1​(x),gj​(y)=E[g^​j​(y−Dj​)],Sj∗​=argymin​gj​(y),gˉ​j​(x)=gj​(min{Sj∗​,x}).

Then S∗=(Sj∗)j=1NS^* = (S^*_j)_{j=1}^NS∗=(Sj∗​)j=1N​ is the optimal echelon base-stock vector and gN(SN∗)g_N(S^*_N)gN​(SN∗​) is the corresponding optimal cost: for every echelon base-stock vector SSS, whose expected cost is gN(SN∣S)g_N(S_N \mid S)gN​(SN​∣S) computed by the same recursion (6.21)-(6.23) with SjS_jSj​ in place of Sj∗S^*_jSj∗​,

gN(SN∗∣S∗)  ≤  gN(SN∣S).g_N(S^*_N \mid S^*) \;\le\; g_N(S_N \mid S).gN​(SN∗​∣S∗)≤gN​(SN​∣S).

Rather than optimizing all base-stock levels simultaneously, one optimizes them one stage at a time from the customer upward, each step a single-variable convex minimization. Zipkin calls (6.24)-(6.27) the fundamental equations of supply chain theory; the result is Clark and Scarf's (1960) for finite horizons and Federgruen and Zipkin's and Chen and Zheng's for the infinite-horizon form used here.

Formalization Note The theorem is about the recursion: the identification of gN(SN∣S)g_N(S_N \mid S)gN​(SN​∣S) with the steady-state expected cost of the physical system is the book's derivation (6.12)-(6.20), which is not restated. S∗S^*S∗ enters as any vector for which each Sj∗S^*_jSj∗​ minimizes gj(⋅∣S∗)g_j(\cdot \mid S^*)gj​(⋅∣S∗); such a vector exists under hj>0h_j > 0hj​>0, p>0p > 0p>0 (cs_sequential_exists).


Retired. Retired because N = 0 was admissible: CSSequential 0 … is vacuous and the conclusion compares csG … 0 at the unrelated points S*₀ and S₀ (accepted disproof); replaced by SupplyChainTheory.clark_scarf_sequential_v2 with 1 ≤ N.

Preamble
import Definitions.Def_SupplyChainTheory_multiechelon
Formal statement
namespace SupplyChainTheory

theorem clark_scarf_sequential (N : ℕ) (h : ℕ → ℝ) (p : ℝ) (D : ℕ → MeasureTheory.Measure ℝ)
    [∀ j, MeasureTheory.IsProbabilityMeasure (D j)]
    (hD : ∀ j, MeasureTheory.Integrable (fun x => x) (D j))
    (hh : ∀ j, 0 ≤ h j) (hp : 0 ≤ p) (Sstar : ℕ → ℝ) (hS : CSSequential N h p D Sstar) :
    ∀ S : ℕ → ℝ, csG N h p D Sstar N (Sstar N) ≤ csG N h p D S N (S N) := 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, p. 196, Sect. 6.2.2, Theorem 6.3, Eq. (6.24)-(6.27); the recursion for a given S is Eq. (6.21)-(6.23), p. 195; after Clark and Scarf (1960) and Chen and Zheng (1994)
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