Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 3.4.2, p. 61 — the smallest s with Σ_{x≤s} p(x|µ) ≥ 1/(1+θc) minimizes f(s) = (1+θc)B(s) + θcs

Proved
ServiceParts.StockLevels.optimal_stock_criterion

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

discrete-convexityinventorylagrangian-relaxationp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1

Let an item have compound Poisson demand with steady-state probabilities p(x∣μ)p(x \mid \mu)p(x∣μ) and expected backorders B(s)B(s)B(s), unit cost c>0c > 0c>0, and let θ>0\theta > 0θ>0 be a Lagrange multiplier. Put

f(s)=(1+θc) B(s)+θc s,s=0,1,2,…f(s) = (1 + \theta c)\,B(s) + \theta c\,s, \qquad s = 0, 1, 2, \dotsf(s)=(1+θc)B(s)+θcs,s=0,1,2,…

Then:

  1. fff is discretely convex: Δ2f(s)≥0\Delta^2 f(s) \ge 0Δ2f(s)≥0 for all sss;
  2. Δf(s)=−(1+θc)(1−∑x≤sp(x∣μ))+θc\Delta f(s) = -(1 + \theta c)\big(1 - \sum_{x \le s} p(x \mid \mu)\big) + \theta cΔf(s)=−(1+θc)(1−∑x≤s​p(x∣μ))+θc;
  3. Δf(s)≥0\Delta f(s) \ge 0Δf(s)≥0 if and only if
∑x≤sp(x∣μ)≥11+θc;\sum_{x \le s} p(x \mid \mu) \ge \frac{1}{1 + \theta c};x≤s∑​p(x∣μ)≥1+θc1​;
  1. some sss satisfies this inequality;
  2. the smallest such sss, call it s∗s^*s∗, is an optimal stock level: f(s∗)≤f(s)f(s^*) \le f(s)f(s∗)≤f(s) for every s≥0s \ge 0s≥0, and f(s∗)<f(s)f(s^*) < f(s)f(s∗)<f(s) for every s<s∗s < s^*s<s∗.

This solves the single-item subproblem of the Lagrangian relaxation of Problem 4, which separates by item type.

Formalization Note The book allows θ≥0\theta \ge 0θ≥0 in (3.38). Here θ>0\theta > 0θ>0 and c>0c > 0c>0 are assumed: at θ=0\theta = 0θ=0 the threshold is 111, which the distribution function of a compound Poisson law never reaches, and f=Bf = Bf=B has no minimizer. Optimality is against every nonnegative integer sss.

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

theorem optimal_stock_criterion (d : CompoundPoissonDemand) (c θ : ℝ) (hc : 0 < c)
    (hθ : 0 < θ) :
    (∀ s, 0 ≤ fdiff2 (relaxedCost d c θ) s) ∧
    (∀ s, fdiff (relaxedCost d c θ) s = -(1 + θ * c) * (1 - d.readyRate s) + θ * c) ∧
    (∀ s, 0 ≤ fdiff (relaxedCost d c θ) s ↔ s ∈ stockSet d c θ) ∧
    (stockSet d c θ).Nonempty ∧
    ∀ sStar : ℕ, IsLeast (stockSet d c θ) sStar →
      (∀ s, relaxedCost d c θ sStar ≤ relaxedCost d c θ s) ∧
      (∀ s, s < sStar → relaxedCost d c θ sStar < relaxedCost d c θ s) := by sorry

end ServiceParts.StockLevels
Source
Muckstadt, Analysis and Algorithms for Service Parts Supply Chains, Springer 2005, DOI 10.1007/b138879, p. 61, Section 3.4.2 (f(s), Δf(s), and the optimal stock level s*)
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