Proof of Theorem 4, p. 939 — the objective ψ_t(v₊, v, ζ) of (4) is L♮-convex
ProvedZipkinLostSales.LNatural.psi_lnatconvexl-natural-convexityoperations-researchp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1submodularity
Let , , , , and let be L♮-convex (standing for ). Consider the objective of program (4),
on the set of with
Then is L♮-convex on : is submodular on , the shift acting on all coordinates .
In the proof of Theorem 4 this is the step before minimizing over .
Formalization Note. Points of are encoded as Fin (L+2) → ℝ with coordinates ordered (Dpsi, liftPsi). The trailing in is the convention and is not shifted. is a total function on whose L♮-convexity is assumed on only; every argument of above lies in . The hypotheses , are the paper's standing cost assumptions.
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 on `V`, the objective `ψ_t(v₊, v, ζ)` of (4) is L♮-convex on its constraint set
(coordinates `(v₊, v₀, …, v_{L−1}, ζ)`). -/
theorem psi_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)
(d : ℝ) (hd : 0 ≤ d) :
LNatConvexOn (Dpsi L d) (liftPsi 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, program (4) and "Moreover, Lemma 1 implies that ψ_t is L♮-convex"
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.