Theorem 2(a)–(b) — pointwise value limits and minimizers
ProvedSongZipkinFluct.Linear.theorem2_abdynamic-programminginventorymarkov-modulated-demandp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
The transformed finite-stage values and auxiliary costs converge pointwise to finite functions and . The first is convex in inventory position and diverges as the position tends upward; the second is convex and diverges at both ends. Consequently has a finite smallest minimizer in every world state.
These limits are the objects in the infinite-horizon basestock theorem.
Preamble
import Mathlib import Definitions.Def_SongZipkinFluct_Linear_Dynamics
Formal statement
namespace SongZipkinFluct.Linear
/-- Song and Zipkin (1993), Theorem 2(a)--(b), p. 357. The limits are
the finite pointwise suprema of the nondecreasing sequences from
Theorem 1. The existence of a smallest minimizer is a conclusion. -/
theorem theorem2_ab {I : Type*} [Countable I] [Nonempty I] [DecidableEq I]
(M : Model I) (hA : M.Assumption1) :
(∀ i : I, ∀ x : ℤ,
Filter.Tendsto (fun n : ℕ => M.Wlin n i x) Filter.atTop (nhds (M.Winf i x))) ∧
(∀ i : I, IntConvex (M.Winf i) ∧
Filter.Tendsto (M.Winf i) Filter.atTop Filter.atTop) ∧
(∀ i : I, ∀ y : ℤ,
Filter.Tendsto (fun n : ℕ => M.Glin (n + 1) i y)
Filter.atTop (nhds (M.Ginf i y))) ∧
(∀ i : I, IntConvex (M.Ginf i) ∧ CoerciveInt (M.Ginf i)) ∧
∃ ystar : I → ℤ,
∀ i : I, SmallestMinimizer (M.Ginf i) (ystar 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. 357, Theorem 2, parts (a)–(b)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.