Eq. (8) —
ProvedVeinottWagnerSS.RenewalCost.eq8_LAlpha_interchangeinventoryp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1renewal-theory
Let be a demand distribution, with , and arbitrary. For every integer and every , the double series (7) defining converges absolutely, and interchanging the order of summation gives
where .
This finite form is what makes computable once is known.
Formalization Note Absolute convergence is stated as summability over of (the inner sum is finite). is defined by the series (7).
Preamble
import Mathlib import Definitions.Def_VeinottWagnerSS_RenewalCost_Demand import Definitions.Def_VeinottWagnerSS_RenewalCost_RenewalFunctions
Formal statement
namespace VeinottWagnerSS.RenewalCost
/-- Veinott & Wagner (1965), Eq. (8), p. 533: under `0 ≤ α ≤ 1` and `α φ(0) < 1`, the double
series (7) defining `L_α(x, d)` converges absolutely, and interchanging the order of summation
gives `L_α(x, d) = G_α(x) + ∑_{j=0}^{d} G_α(x − j) m_α(j)`. -/
theorem eq8_LAlpha_interchange (D : DemandDist) (α : ℝ) (hα0 : 0 ≤ α) (hα1 : α ≤ 1)
(hφ0 : α * D.φ 0 < 1) (G : ℤ → ℝ) (x : ℤ) (d : ℕ) :
Summable (fun i : ℕ => ∑ k ∈ Finset.range (d + 1),
|α ^ (i + 1) * G (x - (k : ℤ)) * convPow D.φ (i + 1) k|) ∧
LAlpha D.φ α G x d =
G x + ∑ j ∈ Finset.range (d + 1), G (x - (j : ℤ)) * mAlpha D.φ α j := by sorry
end VeinottWagnerSS.RenewalCost
Source
Veinott & Wagner, Computing Optimal (s, S) Inventory Policies, Management Sci. 11 (1965), p. 533, Eq. (8)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.