Equation (2) — greedy prefix value at a minimizing period
ProvedWagelmansELS.DualGreedy.equation_2dynamic-programminglot-sizingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Fix a positive-demand period and an index attaining the minimum in the greedy formula for . Assume the induction hypothesis that the greedy prefix value through is . Then
This is Equation (2) of the paper. The minimizing-index equality and the induction hypothesis are explicit assumptions; the monotonicity needed in its derivation remains a conclusion of the separate milestone.
Preamble
import Mathlib import Definitions.Def_WagelmansELS_DualGreedy_Greedy
Formal statement
namespace WagelmansELS.DualGreedy
theorem equation_2 (P : Instance) (v : ℕ → ℝ)
(hd : ∀ t, 1 ≤ t → t ≤ P.n → 0 ≤ P.d t)
(hf : ∀ i, 1 ≤ i → i ≤ P.n → 0 ≤ P.f i)
(hv : IsGreedyForward P v)
(j k : ℕ) (hj1 : 1 ≤ j) (hjn : j ≤ P.n) (hdj : 0 < P.d j)
(hk1 : 1 ≤ k) (hkj : k ≤ j)
(hk : v j = greedyBound P v k j)
(hind : objective P v (k - 1) = F P (k - 1)) :
objective P v j = P.f k + P.c k * demand P k j + F P (k - 1) := by sorry
end WagelmansELS.DualGreedy
Source
Wagelmans, Van Hoesel and Kolen, Economic Lot Sizing, Oper. Res. 40 Supp. 1 (1992), p. S153, Eq. (2) and the preceding sentence
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.