Section 3.3, p. 53 — ΔF(s) = p(s|λτ̄), Δ²F(s) = p(s|λτ̄)(λτ̄/(s+1) − 1): the Poisson fill rate is concave exactly from ⌊λτ̄⌋ on
ProvedServiceParts.StockLevels.fill_rate_differencesdiscrete-convexityfill-rateinventoryp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1poisson-distribution
Let demand be a simple Poisson process and let be the mean number of units in resupply, so that . The fill rate at stock level is . Then for every :
- ;
- if then (the fill rate is not concave there);
- if is not an integer, if and only if ;
- if is an integer, if and only if .
This is why stock levels in fill-rate optimization problems are restricted to : only there is the fill rate discretely concave.
Formalization Note and are positive reals and . "Integer" means for a natural number , which is the only possibility since .
Preamble
import Mathlib import Definitions.Def_ServiceParts_StockLevels_Basic
Formal statement
namespace ServiceParts.StockLevels
theorem fill_rate_differences (lam tbar : ℝ) (hlam : 0 < lam) (htbar : 0 < tbar) (s : ℕ) :
fdiff (poissonFillRate (lam * tbar)) s = poissonPmf (lam * tbar) s ∧
fdiff2 (poissonFillRate (lam * tbar)) s
= poissonPmf (lam * tbar) (s + 1) - poissonPmf (lam * tbar) s ∧
fdiff2 (poissonFillRate (lam * tbar)) s
= poissonPmf (lam * tbar) s * (lam * tbar / ((s : ℝ) + 1) - 1) ∧
((s : ℝ) + 1 < lam * tbar → 0 < fdiff2 (poissonFillRate (lam * tbar)) s) ∧
((¬ ∃ n : ℕ, lam * tbar = n) →
(fdiff2 (poissonFillRate (lam * tbar)) s ≤ 0 ↔ ⌊lam * tbar⌋₊ ≤ s)) ∧
((∃ n : ℕ, lam * tbar = n) →
(fdiff2 (poissonFillRate (lam * tbar)) s ≤ 0 ↔ lam * tbar - 1 ≤ (s : ℝ))) := by sorry
end ServiceParts.StockLevels
Source
Muckstadt, Analysis and Algorithms for Service Parts Supply Chains, Springer 2005, DOI 10.1007/b138879, pp. 52-53, Section 3.3 (F(s), ΔF(s), Δ²F(s) and the concavity region)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.