Valid inequalities and separation for capacitated economic lot sizing (Q1108195)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Valid inequalities and separation for capacitated economic lot sizing |
scientific article; zbMATH DE number 4066623
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Valid inequalities and separation for capacitated economic lot sizing |
scientific article; zbMATH DE number 4066623 |
Statements
Valid inequalities and separation for capacitated economic lot sizing (English)
0 references
1988
0 references
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.
0 references
single item capacitated economic lot sizing problem
0 references
cutting plane
0 references
valid inequalities
0 references
greedy heuristic
0 references
