Theorem 2(d) — the limit solves the optimality equation
ProvedSongZipkinFluct.Linear.theorem2_ddynamic-programminginventorymarkov-modulated-demandp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
The pointwise limits and satisfy the zero-fixed-cost optimality equation (2). For each state , its minimum over feasible order-up-to positions is attained both by the smallest global minimizer and by the limiting finite-stage level , after taking the maximum with .
This identifies the basestock decisions that solve the limit equation.
Preamble
import Mathlib import Definitions.Def_SongZipkinFluct_Linear_Dynamics
Formal statement
namespace SongZipkinFluct.Linear
/-- Song and Zipkin (1993), Theorem 2(d), p. 358. Equation (2) at
`K=0` says `G∞=contG W∞` and `W∞` is its minimum over feasible
order-up-to levels. The displayed equalities attest both minimizers. -/
theorem theorem2_d {I : Type*} [Countable I] [Nonempty I] [DecidableEq I]
(M : Model I) (hA : M.Assumption1) :
∃ (ys : ℕ → I → ℤ) (ystar yinf : I → ℤ),
(∀ n : ℕ, 1 ≤ n → ∀ i : I,
SmallestMinimizer (M.Glin n i) (ys n i)) ∧
(∀ i : I, Filter.Tendsto (fun n : ℕ => ys (n + 1) i)
Filter.atTop (nhds (yinf i))) ∧
(∀ i : I, SmallestMinimizer (M.Ginf i) (ystar i)) ∧
(∀ i : I, ∀ y : ℤ, M.Ginf i (yinf i) ≤ M.Ginf i y) ∧
(∀ i : I, ∀ y : ℤ, M.Ginf i y = M.contG M.Winf i y) ∧
∀ i : I, ∀ x : ℤ,
(∀ y : ℤ, x ≤ y → M.Winf i x ≤ M.Ginf i y) ∧
M.Winf i x = M.Ginf i (max x (ystar i)) ∧
M.Winf i x = M.Ginf i (max x (yinf i)) := by sorry
end SongZipkinFluct.Linear
Source
Song and Zipkin, Inventory Control in a Fluctuating Demand Environment, Oper. Res. 41(2):351–370 (1993), DOI 10.1287/opre.41.2.351, p. 358, Theorem 2(d)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.