§3, p. 533 — for
ProvedVeinottWagnerSS.RenewalCost.f_above_sinventoryp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1renewal-theoryss-policy
Let be a demand distribution, , , , and integers . If the stationary policy is started from stock , its total expected discounted cost satisfies
No order is placed until cumulative demand exceeds ; then an order up to is placed and the process renews.
Formalization Note is passed to and as a natural number ((x - s).toNat, exact because ). is the expected cost of the controlled chain. No convexity or coercivity of is assumed.
Preamble
import Mathlib import Definitions.Def_VeinottWagnerSS_RenewalCost_Demand import Definitions.Def_VeinottWagnerSS_RenewalCost_RenewalFunctions import Definitions.Def_VeinottWagnerSS_RenewalCost_PolicyCost
Formal statement
namespace VeinottWagnerSS.RenewalCost
/-- Veinott & Wagner (1965), §3, p. 533: for `0 ≤ α < 1`, `K ≥ 0` and integers `s ≤ S`, if
`X₁ = x ≥ s` then `f(x) = L_α(x, x − s) + K r_α(x − s) + f(S) r_α(x − s)`. -/
theorem f_above_s (D : DemandDist) (α K : ℝ) (hα0 : 0 ≤ α) (hα1 : α < 1) (hK : 0 ≤ K)
(G : ℤ → ℝ) (s S : ℤ) (hsS : s ≤ S) (x : ℤ) (hx : s ≤ x) :
fCost D α K G s S x =
LAlpha D.φ α G x (x - s).toNat + K * rAlpha D.φ α (x - s).toNat
+ fCost D α K G s S S * rAlpha D.φ α (x - s).toNat := by sorry
end VeinottWagnerSS.RenewalCost
Source
Veinott & Wagner, Computing Optimal (s, S) Inventory Policies, Management Sci. 11 (1965), p. 533, §3, last display (x ≥ s)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.