Valid inequalities and separation for capacitated economic lot sizing (Q1108195): Difference between revisions

The aim of this paper is to solve the single item capacitated economic lot sizing problem by a cutting plane algorithm. In this approach it is necessary to define valid inequalities describing the convex hull of the feasible set. In the case of equal capacities a large subclass of the given inequalities defines facets of the feasible set. Computational results are given with a cutting plane algorithm using a greedy heuristic to solve the separation problem associated with the valid inequalities.