Valid inequalities and separation for capacitated economic lot sizing

Authors:
Yves Pochet
Affiliations:
Center for Operations Research and Econometrics, Université Catholique de Louvain, Louvain, Belgium
Venue:
Operations Research Letters
Year:
1988

Citing 2
Cited 7

Solving mixed integer programming problems using automatic reformulation

Operations Research
Valid inequalities and separation for uncapacitated fixed charge networks

Operations Research Letters

A cross entropy algorithm for the Knapsack problem with setups

Computers and Operations Research
A cross entropy-Lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times

Computers and Operations Research
Lot sizing with inventory gains

Operations Research Letters
Flow pack facets of the single node fixed-charge flow polytope

Operations Research Letters
Flow pack facets of the single node fixed-charge flow polytope

Operations Research Letters
Submodularity and valid inequalities in capacitated fixed charge networks

Operations Research Letters
Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

A family of valid inequalities for the capacitated economic lotsizing problem is given. In the case of equal capacities, studied in more detail, a large subclass of the inequalities defines facets. A heuristic for the separation problem, based on these inequalities, is defined for use in a cutting plane algorithm. We give computational results for 12 and 24 periods test problems and for both the equal and different capacity cases. We also indicate how to extend this class of inequalities for more general capacitated fixed charge networks.