Theorem 1(a)–(c) — convex finite-stage basestock problems
ProvedSongZipkinFluct.Linear.theorem1_acdynamic-programminginventorymarkov-modulated-demandp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
In the zero-fixed-cost model with zero terminal cost, for every and every world state , is convex and diverges at both ends. It therefore has a finite smallest minimizer . The finite-stage minimum is attained by ordering up to the greater of the current position and , and is convex.
This is the finite-stage basestock assertion used in the limiting argument.
Preamble
import Mathlib import Definitions.Def_SongZipkinFluct_Linear_Dynamics
Formal statement
namespace SongZipkinFluct.Linear
/-- Song and Zipkin (1993), Theorem 1(a)--(c), printed "Theorem 4",
p. 357. The finite-horizon problem has `K=0`, `W₀=0` as in §3.1.
Part (b) is the assertion that the minimum in (13) is attained by the
world-dependent basestock decision; `W_n` is the optimal n-stage cost
by the recursion's definition. -/
theorem theorem1_ac {I : Type*} [Countable I] [Nonempty I] [DecidableEq I]
(M : Model I) (hA : M.Assumption1) :
∃ ys : ℕ → I → ℤ,
(∀ n : ℕ, 1 ≤ n → ∀ i : I,
IntConvex (M.Glin n i) ∧ CoerciveInt (M.Glin n i) ∧
SmallestMinimizer (M.Glin n i) (ys n i) ∧
∀ x : ℤ, M.Wlin n i x = M.Glin n i (max x (ys n i))) ∧
∀ n : ℕ, 1 ≤ n → ∀ i : I, IntConvex (M.Wlin n 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 1 (printed "Theorem 4"), parts (a)–(c)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.