Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sect. 10.1.1, p. 196: given y2y_2y2​ and D(L2)D(L_2)D(L2​), the best feasible y1y_1y1​ is min⁡{y^1∗,y2−D(L2)}\min\{\hat y_1^*, y_2 - D(L_2)\}min{y^​1∗​,y2​−D(L2​)}

Proved
InventoryControl.cs_allocation_min

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

clark-scarfinventory-controlmulti-echelonoperations-researchoptimization

Let S1=y^1∗S_1 = \hat y_1^{*}S1​=y^​1∗​ satisfy the fractile condition (10.8), with e1,e2≥0e_1, e_2 \ge 0e1​,e2​≥0, b1>0b_1 > 0b1​>0 and σ>0\sigma > 0σ>0. In a period in which installation 2 holds the echelon position y2y_2y2​ and the demand over the lead-time L2L_2L2​ turns out to be uuu, installation 1 can realize any position y1≤y2−uy_1 \le y_2 - uy1​≤y2​−u (Eq. 10.1), and among these the cheapest is

y1  =  min⁡{S1, y2−u}:C~1(min⁡{S1,y2−u})  ≤  C~1(y1)for every y1≤y2−u.y_1 \;=\; \min\{S_1,\ y_2 - u\}: \qquad \tilde C_1\big(\min\{S_1, y_2 - u\}\big) \;\le\; \tilde C_1(y_1) \quad\text{for every } y_1 \le y_2 - u.y1​=min{S1​, y2​−u}:C~1​(min{S1​,y2​−u})≤C~1​(y1​)for every y1​≤y2​−u.

If enough stock is available the unconstrained optimum S1S_1S1​ is chosen; otherwise everything available is passed on, because C~1\tilde C_1C~1​ is convex and decreasing to the left of its minimizer. This is the rule an echelon-stock order-up-to-S1S_1S1​ policy implements, and the book stresses that it does not depend on y2y_2y2​: the optimal policy at installation 1 is determined before anything is known about installation 2.

Preamble
import Definitions.Def_InventoryControl_clarkScarf
Formal statement
namespace InventoryControl

theorem cs_allocation_min (e1 e2 b1 mu sigma : ℝ) (he1 : 0 ≤ e1) (he2 : 0 ≤ e2) (hb : 0 < b1)
    (hs : 0 < sigma) (L1 : ℕ) (S1 : ℝ)
    (hS1 : ProbabilityTheory.cdf (ProbabilityTheory.gaussianReal 0 1)
      ((S1 - (L1 + 1) * mu) / (Real.sqrt (L1 + 1) * sigma)) = (e2 + b1) / (e1 + e2 + b1))
    (y2 u y1 : ℝ) (hy : y1 ≤ y2 - u) :
    csStage1Cost e1 e2 b1 mu sigma L1 (min S1 (y2 - u)) ≤ csStage1Cost e1 e2 b1 mu sigma L1 y1 := by sorry

end InventoryControl
Source
Sven Axsäter, Inventory Control, 3rd ed., Springer 2015, DOI 10.1007/978-3-319-15729-0, p. 196, Sect. 10.1.1: 'If y2 - D(L2) >= y-hat*1 we obtain the optimal solution if we have y1 = y-hat*1. But if y2 - D(L2) < y-hat*1, the best possible value of y1 is y1 = y2 - D(L2) due to the convexity of (10.6)'
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