Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 3.4.2, p. 60 — E[On-hand] = s − λτ̄ū + B(s)

Proved
ServiceParts.StockLevels.expected_on_hand

by mikedeng1 · Oct 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

backorderscompound-poissoninventoryp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1

Let an item have compound Poisson demand with order rate λ\lambdaλ, mean resupply time τˉ\bar\tauτˉ and finite mean order size uˉ\bar uuˉ, and let p(x)=p(x∣λτˉ)p(x) = p(x \mid \lambda\bar\tau)p(x)=p(x∣λτˉ) be the steady-state probability that xxx units are on order. Under an (s−1,s)(s-1, s)(s−1,s) policy with stock level sss, the number on hand is (s−x)+(s - x)^+(s−x)+ when xxx units are on order, and

E[On-hand]=∑x≤s(s−x) p(x)=s−λτˉuˉ+B(s),E[\text{On-hand}] = \sum_{x \le s} (s - x)\,p(x) = s - \lambda\bar\tau\bar u + B(s),E[On-hand]=x≤s∑​(s−x)p(x)=s−λτˉuˉ+B(s),

where B(s)=∑x>s(x−s) p(x)B(s) = \sum_{x > s}(x - s)\,p(x)B(s)=∑x>s​(x−s)p(x) is the expected number of backorders.

With μ=λτˉuˉ\mu = \lambda\bar\tau\bar uμ=λτˉuˉ, the average investment in on-hand inventory of an item with unit cost ccc is therefore c [s−μ+B(s)]c\,[s - \mu + B(s)]c[s−μ+B(s)], the budget term of Problem 4.

Formalization Note The book obtains the identity from the constancy of the inventory position and Little's law (E[On-order]=λτˉuˉE[\text{On-order}] = \lambda\bar\tau\bar uE[On-order]=λτˉuˉ). Here it is stated for the steady-state distribution itself, where E[On-order]=∑xx p(x)E[\text{On-order}] = \sum_x x\,p(x)E[On-order]=∑x​xp(x); the identity then contains the fact that the compound Poisson distribution has mean λτˉuˉ\lambda\bar\tau\bar uλτˉuˉ.

Preamble
import Mathlib
import Definitions.Def_ServiceParts_StockLevels_CompoundPoissonDemand
Formal statement
namespace ServiceParts.StockLevels

theorem expected_on_hand (d : CompoundPoissonDemand) (s : ℕ) :
    d.expectedOnHand s = (s : ℝ) - d.lam * d.tbar * d.ubar + d.backorders s := by sorry

end ServiceParts.StockLevels
Source
Muckstadt, Analysis and Algorithms for Service Parts Supply Chains, Springer 2005, DOI 10.1007/b138879, p. 60, Section 3.4.2 (E[On-hand] = s_i − λ_i τ̄_i ū_i + B_i(s_i))
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 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