Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 3.4.2, p. 63 — θ_max = max_i (1/c_i)(1/p(0|µ_i) − 1) makes every s_i*(θ_max) = 0

Proved
ServiceParts.StockLevels.theta_max_zero_stock

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

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

Consider n≥1n \ge 1n≥1 item types with compound Poisson demand and unit costs ci>0c_i > 0ci​>0, and let p(0∣μi)p(0 \mid \mu_i)p(0∣μi​) be the probability that no unit of item iii is in resupply. For each iii put

θi=1ci(1p(0∣μi)−1).\theta_i = \frac{1}{c_i}\Big(\frac{1}{p(0 \mid \mu_i)} - 1\Big).θi​=ci​1​(p(0∣μi​)1​−1).

Then θi>0\theta_i > 0θi​>0 and p(0∣μi)=1/(1+θici)p(0 \mid \mu_i) = 1/(1 + \theta_i c_i)p(0∣μi​)=1/(1+θi​ci​). Moreover, with θmax⁡=max⁡iθi\theta_{\max} = \max_i \theta_iθmax​=maxi​θi​, the smallest stock level sss with

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

is s=0s = 0s=0 for every item iii, that is, si∗(θmax⁡)=0s_i^*(\theta_{\max}) = 0si∗​(θmax​)=0.

This gives the upper end of the bisection interval [θmin⁡,θmax⁡][\theta_{\min}, \theta_{\max}][θmin​,θmax​] used by the book's algorithm for Problem 4.

Formalization Note The item index set is finite and nonempty, so that the maximum exists.

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

theorem theta_max_zero_stock {ι : Type*} [Fintype ι] [Nonempty ι]
    (d : ι → CompoundPoissonDemand) (c : ι → ℝ) (hc : ∀ i, 0 < c i) :
    (∀ i, 0 < thetaZero (d i) (c i) ∧
      (d i).pmf 0 = 1 / (1 + thetaZero (d i) (c i) * c i)) ∧
    ∀ i, IsLeast
      (stockSet (d i) (c i) (Finset.univ.sup' Finset.univ_nonempty
        (fun j => thetaZero (d j) (c j)))) 0 := by sorry

end ServiceParts.StockLevels
Source
Muckstadt, Analysis and Algorithms for Service Parts Supply Chains, Springer 2005, DOI 10.1007/b138879, p. 63, Section 3.4.2 (θ with p(0|µ_i) = 1/(1 + θc_i), θmax)
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