Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6.5: in a guaranteed-service serial system with s1=0s_1 = 0s1​=0, every stage quotes Si∗=0S^*_i = 0Si∗​=0 or Si∗=Si+1∗+TiS^*_i = S^*_{i+1} + T_iSi∗​=Si+1∗​+Ti​

Proved
SupplyChainTheory.gs_all_or_nothing

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

concave-minimizationguaranteed-servicemultiechelonoperations-researchsupply-chain

Theorem 6.5. In the guaranteed-service serial system of Sect. 6.3.4, with holding costs hi>0h_i > 0hi​>0, k=zασ>0k = z_\alpha\sigma > 0k=zα​σ>0, processing times Ti≥0T_i \ge 0Ti​≥0 and external inbound time SIN≥0SI_N \ge 0SIN​≥0, suppose s1=0s_1 = 0s1​=0 (immediate service is required to the customer). If S∗S^*S∗ with S1∗=0S^*_1 = 0S1∗​=0 minimizes the holding cost g(S)=∑ihikSIi+Ti−Sig(S) = \sum_i h_i k\sqrt{SI_i + T_i - S_i}g(S)=∑i​hi​kSIi​+Ti​−Si​​ over all feasible committed service times with S1=0S_1 = 0S1​=0, then for all i=2,…,Ni = 2, \dots, Ni=2,…,N,

Si∗=0orSi∗=Si+1∗+Ti,S^*_i = 0 \qquad\text{or}\qquad S^*_i = S^*_{i+1} + T_i,Si∗​=0orSi∗​=Si+1∗​+Ti​,

with SN+1∗=SINS^*_{N+1} = SI_NSN+1∗​=SIN​. Each stage follows an all-or-nothing policy: it either holds no safety stock and quotes the longest possible service time, or holds the most safety stock and quotes zero. The book omits the proof (Problem 6.6); the cost is concave in every SiS_iSi​ and strictly concave along every direction that changes some net lead time, so a minimizer is a vertex of the feasible polytope, and with s1=0s_1 = 0s1​=0 every vertex has this form. The book notes the property fails for tree systems (Figure 6.11).

Formalization Note The service times are real rather than integer. Since the vertices of the feasible region are integral when the TiT_iTi​ and SINSI_NSIN​ are, every integer-optimal vector is also optimal over the reals, so the real statement contains the book's integer one.

Preamble
import Definitions.Def_SupplyChainTheory_multiechelon
Formal statement
namespace SupplyChainTheory

theorem gs_all_or_nothing (N : ℕ) (h : ℕ → ℝ) (k : ℝ) (T : ℕ → ℝ) (SIN : ℝ)
    (hk : 0 < k) (hh : ∀ i ∈ Finset.Icc 1 N, 0 < h i) (hT : ∀ i, 0 ≤ T i) (hSI : 0 ≤ SIN)
    (S : ℕ → ℝ) (hS1 : S 1 = 0) (hfeas : GSFeasible N T SIN S)
    (hopt : ∀ S' : ℕ → ℝ, S' 1 = 0 → GSFeasible N T SIN S' →
      gsCost N h k T SIN S ≤ gsCost N h k T SIN S') :
    ∀ i ∈ Finset.Icc 2 N, S i = 0 ∨ S i = gsInbound N SIN S i + T i := 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. 208, Sect. 6.3.4, Theorem 6.5: 'Proof. Omitted; see Problem 6.6'; the model is Eq. (6.37)-(6.42), pp. 207-208
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