Section 2: the envelope endpoints are efficient
ProvedWagelmansELS.Efficient.endpoint_efficientconvex-envelopelot-sizingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
For each , the point at the largest plotted abscissa is . In particular, for every later plotted period with the same abscissa, . The periods and are efficient:
This identifies the two endpoint breakpoints and ensures the efficient-period set is nonempty.
Formalization Note If equal abscissae and heights occur, the earliest index is kept. The last demand is positive, so the sentinel is the only plotted period at abscissa zero.
Preamble
import Mathlib import Definitions.Def_WagelmansELS_Efficient_EfficientPeriods
Formal statement
namespace WagelmansELS.Efficient
/-- Section 2, p. S147: the right endpoint of the envelope is `(D(i+1),G(i+1))`;
p. S148 declares the left endpoint `(0,0)` a breakpoint. -/
theorem endpoint_efficient (P : Instance) (i : ℕ) (hi : 1 ≤ i) (hin : i ≤ P.n) :
(∀ t ∈ Finset.Ioc i (P.n + 1), i + 1 < t → P.D t = P.D (i + 1) →
P.G (i + 1) ≤ P.G t) ∧
P.IsEfficient i (i + 1) ∧ P.IsEfficient i (P.n + 1) := by sorry
end WagelmansELS.Efficient
Source
Wagelmans, Van Hoesel and Kolen, Economic Lot Sizing, Oper. Res. 40 Supp. 1 (1992), p. S147, Section 2, sentence beginning “It follows that g(d_{i+1,n}) = G(i + 1)”; p. S148, endpoint breakpoints
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.