Theorem 5(d) — W_∞ and G_∞ satisfy the optimality equation (2)
ProvedSongZipkinFluct.FixedCost.theorem5ddynamic-programminginventoryoptimality-equationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
In the fixed-cost model (standing hypotheses, , , of the linear model), the limits , satisfy the optimality equation (2): for all and the minimum below is attained and
and for all and
Equation (2) is the transformed form of the infinite-horizon optimality equation (1), so this identifies as a solution of the Bellman equation of the fixed-cost problem.
Preamble
import Mathlib import Definitions.Def_SongZipkinFluct_FixedCost_Bounds open Filter Topology
Formal statement
namespace SongZipkinFluct.FixedCost
open Model
/-- Theorem 5(d) (p. 359) of Song and Zipkin (1993). Fixed-cost model of §3.2
(`K = K̄F̃_L(α) > 0`, `W₀ = W_∞` of the linear model). The limits `W_∞`, `G_∞` satisfy the
optimality equation (2) (p. 355):
`W_∞(i, x) = min_{y ≥ x} {Kδ(y − x) + G_∞(i, y)}` (the minimum is attained) and
`G_∞(i, y) = G⁺(i, y) + βλ_i c + β{λ_i W_∞(i, y − 1) + Σ_{j≠i} q_ij W_∞(j, y) + (μ − λ_i − q_i) W_∞(i, y)}`.
-/
theorem theorem5d {I : Type*} [Countable I] [Nonempty I] [DecidableEq I] (M : Model I)
(hM : M.Standing) (hA1 : M.α * M.cbar < M.p) (hK : 0 < M.Kbar) :
(∀ (i : I) (x : ℤ), IsLeast
(Set.range fun y : {y : ℤ // x ≤ y} => M.K * SongZipkinFluct.Linear.delta (y.1 - x) + GinfK M i y.1)
(WinfK M i x)) ∧
∀ (i : I) (y : ℤ), GinfK M i y = contG M (WinfK M) i y := by sorry
end SongZipkinFluct.FixedCost
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. 359, Theorem 5(d); p. 355, (2)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.