Section 4 — weak duality for every prefix
ProvedWagelmansELS.DualGreedy.weak_dualitylinear-optimizationlot-sizingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be any feasible vector for Program D′, and let be the forward lot-sizing cost. For every prefix ,
The paper invokes duality and the structure of D′ for this upper bound. This formulation makes the prefix and the feasible class explicit, including zero-demand periods.
Preamble
import Mathlib import Definitions.Def_WagelmansELS_DualGreedy_Model
Formal statement
namespace WagelmansELS.DualGreedy
theorem weak_duality (P : Instance) (u : ℕ → ℝ)
(hd : ∀ t, 1 ≤ t → t ≤ P.n → 0 ≤ P.d t)
(hf : ∀ i, 1 ≤ i → i ≤ P.n → 0 ≤ P.f i)
(hu : IsFeasible P u)
(j : ℕ) (hj1 : 1 ≤ j) (hjn : j ≤ P.n) :
objective P u j ≤ F P j := by sorry
end WagelmansELS.DualGreedy
Source
Wagelmans, Van Hoesel and Kolen, Economic Lot Sizing, Oper. Res. 40 Supp. 1 (1992), p. S153, Section 4, “by duality and the structure of (D′), Σ d_t v_t ≤ F(j) must hold”
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.