Lemma 1 — convexity of C and G⁺
ProvedSongZipkinFluct.Linear.lemma1dynamic-programminginventorymarkov-modulated-demandp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Fix a world state . The expected lead-time inventory cost and the myopic cost are convex as functions of integer inventory position: their forward differences are nondecreasing.
This supplies the discrete convexity used to identify basestock minimizers.
Preamble
import Mathlib import Definitions.Def_SongZipkinFluct_Linear_Model
Formal statement
namespace SongZipkinFluct.Linear
/-- Song and Zipkin (1993), Lemma 1, p. 355. Convexity is the
monotonicity of integer forward differences, not integer-scaled `ConvexOn`. -/
theorem lemma1 {I : Type*} [Countable I] [Nonempty I] [DecidableEq I]
(M : Model I) :
∀ i : I, IntConvex (M.C i) ∧ IntConvex (M.Gplus 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. 355, Lemma 1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.