Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (10.9): the expected cost of the order-up-to-S1S_1S1​ rule is C^2(y2)\hat C_2(y_2)C^2​(y2​)

Proved
InventoryControl.cs_total_cost_eq

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

clark-scarfinventory-controlmulti-echelonoperations-researchprobability

When installation 2 holds the echelon position y2y_2y2​ and installation 1 realizes y1=min⁡{S1,y2−D(L2)}y_1 = \min\{S_1, y_2 - D(L_2)\}y1​=min{S1​,y2​−D(L2​)}, the expected total reallocated cost E[C~2(y2)+C~1(min⁡{S1,y2−D(L2)})]\mathbb{E}\big[\tilde C_2(y_2) + \tilde C_1(\min\{S_1, y_2 - D(L_2)\})\big]E[C~2​(y2​)+C~1​(min{S1​,y2​−D(L2​)})] equals

C^2(y2)  =  h2(y2−μ2′)+C^1(S1)+∫y2−S1∞[C^1(y2−u)−C^1(S1)] 1σ2′φ ⁣(u−μ2′σ2′)du,\hat C_2(y_2) \;=\; h_2(y_2 - \mu_2') + \hat C_1(S_1) + \int_{y_2 - S_1}^{\infty}\big[\hat C_1(y_2 - u) - \hat C_1(S_1)\big]\,\frac{1}{\sigma_2'}\varphi\!\Big(\frac{u - \mu_2'}{\sigma_2'}\Big)\mathrm{d}u,C^2​(y2​)=h2​(y2​−μ2′​)+C^1​(S1​)+∫y2​−S1​∞​[C^1​(y2​−u)−C^1​(S1​)]σ2′​1​φ(σ2′​u−μ2′​​)du,

for every y2y_2y2​, every level S1S_1S1​ and σ>0\sigma > 0σ>0, with μ2′=L2μ\mu_2' = L_2\muμ2′​=L2​μ and σ2′=L2 σ\sigma_2' = \sqrt{L_2}\,\sigmaσ2′​=L2​​σ.

The last term is the book's "shortage cost at installation 2 induced by its inability to deliver on time to installation 1": on the event D(L2)>y2−S1D(L_2) > y_2 - S_1D(L2​)>y2​−S1​ installation 1 receives only y2−D(L2)y_2 - D(L_2)y2​−D(L2​) instead of S1S_1S1​. The identity holds for any S1S_1S1​; it is the evaluation of a piecewise expectation, and it is what makes C^2\hat C_2C^2​ computable from the tabulated loss function.

Preamble
import Definitions.Def_InventoryControl_clarkScarf
Formal statement
namespace InventoryControl

theorem cs_total_cost_eq (e1 e2 b1 mu sigma : ℝ) (hs : 0 < sigma) (L1 L2 : ℕ) (S1 y2 : ℝ) :
    ∫ u, (csStage2Cost e2 mu L2 y2 + csStage1Cost e1 e2 b1 mu sigma L1 (min S1 (y2 - u)))
        ∂(csDemand mu sigma L2)
      = csTotalCost e1 e2 b1 mu sigma L1 L2 S1 y2 := 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, Eq. (10.9)
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