Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 3.4.2, pp. 58-61 — the Lagrangian stock levels s_i*(θ) solve Problem 4 with budget b = C(θ)

Proved
ServiceParts.StockLevels.lagrangian_stock_levels_optimal

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

backorderseverettinventorylagrangian-relaxationp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1

Consider nnn item types managed at a single location by (s−1,s)(s-1, s)(s−1,s) policies. Item iii has stationary compound Poisson demand with steady-state resupply probabilities p(x∣μi)p(x \mid \mu_i)p(x∣μi​), expected backorders Bi(s)B_i(s)Bi​(s), mean lead-time demand μi=λiτˉiuˉi\mu_i = \lambda_i\bar\tau_i\bar u_iμi​=λi​τˉi​uˉi​, and unit cost ci>0c_i > 0ci​>0. Problem 4 (3.40) with budget bbb is

min⁡∑i=1nBi(si)s.t.∑i=1nci [si−μi+Bi(si)]≤b,si=0,1,…\min \sum_{i=1}^n B_i(s_i) \quad\text{s.t.}\quad \sum_{i=1}^n c_i\,[s_i - \mu_i + B_i(s_i)] \le b, \quad s_i = 0, 1, \dotsmini=1∑n​Bi​(si​)s.t.i=1∑n​ci​[si​−μi​+Bi​(si​)]≤b,si​=0,1,…

Fix a multiplier θ>0\theta > 0θ>0. For every item there is a stock level sss with

∑x≤sp(x∣μi)≥11+θci,\sum_{x \le s} p(x \mid \mu_i) \ge \frac{1}{1 + \theta c_i},x≤s∑​p(x∣μi​)≥1+θci​1​,

and if si∗(θ)s_i^*(\theta)si∗​(θ) denotes the smallest one, then the vector s∗(θ)s^*(\theta)s∗(θ) is an optimal solution of Problem 4 with budget

b=C(θ)=∑i=1nci [si∗(θ)−μi+Bi(si∗(θ))]:b = C(\theta) = \sum_{i=1}^n c_i\,\big[s_i^*(\theta) - \mu_i + B_i(s_i^*(\theta))\big]:b=C(θ)=i=1∑n​ci​[si∗​(θ)−μi​+Bi​(si∗​(θ))]:

every vector of nonnegative integer stock levels sss with ∑ici[si−μi+Bi(si)]≤C(θ)\sum_i c_i[s_i - \mu_i + B_i(s_i)] \le C(\theta)∑i​ci​[si​−μi​+Bi​(si​)]≤C(θ) satisfies

∑i=1nBi(si∗(θ))≤∑i=1nBi(si).\sum_{i=1}^n B_i(s_i^*(\theta)) \le \sum_{i=1}^n B_i(s_i).i=1∑n​Bi​(si∗​(θ))≤i=1∑n​Bi​(si​).

Varying θ\thetaθ therefore traces optimal backorder–investment trade-offs, which is how the book's bisection algorithm for Problem 4 is justified.

Formalization Note The book's text asserts this by combining Everett's theorem (Theorem 10, p. 57, and the remark on p. 58 that varying θ\thetaθ yields optimal solutions of Problem 3) with the item-wise criterion of p. 61. θ>0\theta > 0θ>0 and ci>0c_i > 0ci​>0 are assumed; at θ=0\theta = 0θ=0 the criterion has no solution. The index set of items is any finite type.

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

theorem lagrangian_stock_levels_optimal {ι : Type*} [Fintype ι]
    (d : ι → CompoundPoissonDemand) (c : ι → ℝ) (hc : ∀ i, 0 < c i) (θ : ℝ) (hθ : 0 < θ) :
    (∀ i, (stockSet (d i) (c i) θ).Nonempty) ∧
    ∀ sStar : ι → ℕ, (∀ i, IsLeast (stockSet (d i) (c i) θ) (sStar i)) →
      ∀ s : ι → ℕ, totalInvestment d c s ≤ totalInvestment d c sStar →
        totalBackorders d sStar ≤ totalBackorders d s := by sorry

end ServiceParts.StockLevels
Source
Muckstadt, Analysis and Algorithms for Service Parts Supply Chains, Springer 2005, DOI 10.1007/b138879, pp. 57-61, Section 3.4.1 Theorem 10 and p. 58, Section 3.4.2, Problem 4 Eq. (3.40), and p. 61 (optimal stock level s* and C(θ))
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