Lemma 4 — uniform finite bounds on Wₙ
ProvedSongZipkinFluct.Linear.lemma4dynamic-programminginventorymarkov-modulated-demandp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Suppose the terminal transformed cost lies between zero and a finite nondecreasing bound for every world state. Then a finite nondecreasing function bounds every later stage cost uniformly in the world state and stage number:
This bound keeps the infinite-state continuation sums finite. The model's discounted fixed cost is used in the recursion.
Preamble
import Mathlib import Definitions.Def_SongZipkinFluct_Linear_Dynamics
Formal statement
namespace SongZipkinFluct.Linear
/-- Song and Zipkin (1993), Lemma 4, p. 356, displays (11)--(12).
Here `K=M.K` is the model's discounted fixed order cost. The hypothesis
on `W₀` is exactly (11), and no summability of the recursion is assumed. -/
theorem lemma4 {I : Type*} [Countable I] [Nonempty I] [DecidableEq I]
(M : Model I) (hA : M.Assumption1)
(W₀ : I → ℤ → ℝ)
(WBound₀ : ℤ → ℝ) (hmono₀ : Monotone WBound₀)
(hbound₀ : ∀ i x, 0 ≤ W₀ i x ∧ W₀ i x ≤ WBound₀ x) :
∃ WBound : ℤ → ℝ, Monotone WBound ∧
∀ n : ℕ, 1 ≤ n → ∀ i x, 0 ≤ M.W M.K W₀ n i x ∧
M.W M.K W₀ n i x ≤ WBound x := 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. 356, Lemma 4, (11)–(12)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.