Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||THE APPLICATION OF VALID INEQUALITIES TO THE MULTISTAGE LOT-SIZING PROBLEM|
|Abstract:||A capacitated multi-stage lot-sizing problem for general product structures with setup and lead times is considered. The problem is formulated as a mixed integer linear program and valid inequalities that are high dimension faces of the problem's convex hull are identified. A fast separation algorithm is developed to iteratively select those inequalities that cut off the solution of the linear programming relaxation. The resulting much improved lower bounds are used in a Branch-and-Bound algorithm. Computational test results are presented.|
|Editor:||Pergamon-elsevier Science Ltd|
|Citation:||Computers & Operations Research. Pergamon-elsevier Science Ltd, v. 22, n. 7, n. 669, n. 680, 1995.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.