Proof of Theorem 4, p. 939 — the end-of-period cost κ̄_t(v, ζ | d) is L♮-convex
ProvedZipkinLostSales.LNatural.kappa_lnatconvexl-natural-convexityoperations-researchp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1submodularity
Let , , , , and let be L♮-convex and nonnegative on (standing for ). Define, for and ,
which is program (4). Then is L♮-convex on .
This is the end-of-period half of the induction step of Theorem 4; the expectation over then gives .
Formalization Note. The paper writes ; the formalization takes the infimum over the interval , which is nonempty for , . The hypothesis on (true for the model's ) keeps the infimum over a set bounded below. L♮-convexity on is LNatConvexOn (VxNeg L) with as the last coordinate, the shift acting on all coordinates.
Preamble
import Mathlib import Definitions.Def_ZipkinLostSales_LNatural_Model open MeasureTheory
Formal statement
namespace ZipkinLostSales.LNatural
/-- Proof of Theorem 4 (Zipkin 2008, p. 939): if the continuation `F` (standing for `f̄_{t+1}`) is
L♮-convex and nonnegative on `V`, then for each demand value `d ≥ 0` the end-of-period cost
`κ̄(v, ζ | d)` of (4) is L♮-convex on `V × ℜ⁻`. -/
theorem kappa_lnatconvex (L : ℕ) (hL : 0 < L) (hh p γ : ℝ) (hhh : 0 ≤ hh) (hp : 0 ≤ p)
(hγ0 : 0 < γ) (hγ1 : γ ≤ 1) (F : (Fin L → ℝ) → ℝ) (hF : LNatConvexOn (V L) F)
(hF0 : ∀ v ∈ V L, 0 ≤ F v) (d : ℝ) (hd : 0 ≤ d) :
LNatConvexOn (VxNeg L) (liftG (kappa hh p γ F d)) := by sorry
end ZipkinLostSales.LNatural
Source
Zipkin, On the Structure of Lost-Sales Inventory Models, Oper. Res. 56 (2008), p. 939 (PDF p. 4), proof of Theorem 4, "an argument like that of Lemma 2 shows that κ̄_t is L♮-convex"
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.