Lemma 7, p. 940 — the last-period optimal cost f_T(v) is nondecreasing in v
DisprovedZipkinLostSales.Bounds.lemma_7dynamic-programminginventorylost-salesoperations-researchp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Consider the lost-sales model of §4 under its standing assumptions. The optimal cost in the last period,
is nondecreasing on the state space for the componentwise order: if and for every , then .
Together with the convexity of in , this is what propagates monotonicity backwards in Theorem 8.
Formalization Note is fB M 1 (one period to go). The paper proves the lemma for and says the proof for larger is similar; the statement here is for every . "Nondecreasing in " is monotonicity on for the pointwise order on . The minimum is an infimum over ; the identification with §2's model is not formalized.
Preamble
import Mathlib import Definitions.Def_ZipkinLostSales_Bounds_Model
Formal statement
namespace ZipkinLostSales.Bounds
/-- Lemma 7, p. 940: the optimal cost `f_T(v)` (`fB M 1`) is nondecreasing in `v` on `V`, for the
componentwise order. -/
theorem lemma_7 {L : ℕ} (M : Data) (hM : Assumptions L M) :
MonotoneOn (fB M 1) (ZipkinLostSales.LNatural.V L) := by sorry
end ZipkinLostSales.Bounds
Source
Zipkin, On the Structure of Lost-Sales Inventory Models, Oper. Res. 56 (2008), p. 940 (PDF p. 5), Lemma 7
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.