Theorem 8, p. 940 — for all t ≤ T, f_t(v) is nondecreasing in v and z̄_t(v) ≤ z̄_T(v)
DisprovedZipkinLostSales.Bounds.theorem_8dynamic-programminginventorylost-salesoperations-researchp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Consider the lost-sales model of §4 under its standing assumptions. For every period :
- the optimal cost is nondecreasing on for the componentwise order;
- for every , the optimal order is at most the last-period one:
Here is the smallest minimizer of over . With Lemma 6, part 2 shows that the bounds hold in every period.
Formalization Note Period is indexed by : is fB M (k+1) and is the least minimizer of gB M k; is the least minimizer of gB M 0 . Part 2 asserts that the least minimizers of and of exist and satisfy . The identification of §4's recursion with §2's is not formalized.
Preamble
import Mathlib import Definitions.Def_ZipkinLostSales_Bounds_Model
Formal statement
namespace ZipkinLostSales.Bounds
/-- Theorem 8, p. 940: for all `t ≤ T` (every `k`, `t = T − k`), `f_t(v)` is nondecreasing in `v`
on `V`, and the smallest optimal orders `z̄_t(v)` and `z̄_T(v)` exist and satisfy
`z̄_t(v) ≤ z̄_T(v)`. -/
theorem theorem_8 {L : ℕ} (M : Data) (hM : Assumptions L M) (k : ℕ) :
MonotoneOn (fB M (k + 1)) (ZipkinLostSales.LNatural.V L) ∧
∀ v ∈ ZipkinLostSales.LNatural.V L,
∃ z z' : ℝ, IsOptOrder M k v z ∧ IsOptOrder M 0 v z' ∧ z ≤ z' := by sorry
end ZipkinLostSales.Bounds
Source
Zipkin, On the Structure of Lost-Sales Inventory Models, Oper. Res. 56 (2008), p. 940 (PDF p. 5), Theorem 8
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.