Section 3.4.2, p. 63 — θ_max = max_i (1/c_i)(1/p(0|µ_i) − 1) makes every s_i*(θ_max) = 0
ProvedServiceParts.StockLevels.theta_max_zero_stockinventorylagrangian-relaxationp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1
Consider item types with compound Poisson demand and unit costs , and let be the probability that no unit of item is in resupply. For each put
Then and . Moreover, with , the smallest stock level with
is for every item , that is, .
This gives the upper end of the bisection interval 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.