POCHET, Yves; WOLSEY, Laurence - Center for Operations Research and Econometrics (CORE), … - 2007
-sizing problem is polynomially solvable using dynamic programming. When the capacities are non-decreasing, we derive a compact mixed …-decreasing, we derive a compact mixed integer programing
reformulation whose linear programing relaxation solves the lot …, and with both non-
decreasing and arbitrary capacities over time.
Keywords: lot-sizing, mixing set relaxation, compact …