Proposition 1: only efficient periods are needed in the minimum
ProvedWagelmansELS.Efficient.proposition_1convex-envelopelot-sizingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
For a period , let be the efficient periods of the plotted points . Then is nonempty and
Thus every excluded period is dominated for the candidate-cost calculation by an efficient period. This reduces the backward recursion to lower-envelope vertices.
Formalization Note The finite attained minima use Finset.inf', whose domain is explicitly nonempty. The setup cost is absent from both sides because it is common to all candidates.
Preamble
import Mathlib import Definitions.Def_WagelmansELS_Efficient_EfficientPeriods
Formal statement
namespace WagelmansELS.Efficient
/-- Proposition 1, p. S148: removing non-breakpoint periods leaves the minimum unchanged. -/
theorem proposition_1 (P : Instance) (i : ℕ) (hi : 1 ≤ i) (hin : i ≤ P.n) :
(P.E i).Nonempty ∧
∀ h : (P.E i).Nonempty,
(Finset.Ioc i (P.n + 1)).inf' (by simp; omega) (P.score i) =
(P.E i).inf' h (P.score i) := by sorry
end WagelmansELS.Efficient
Source
Wagelmans, Van Hoesel and Kolen, Economic Lot Sizing, Oper. Res. 40 Supp. 1 (1992), p. S148, Proposition 1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.