Article ID: | iaor19921687 |
Country: | United States |
Volume: | 40 |
Start Page Number: | 18 |
End Page Number: | 24 |
Publication Date: | Jan 1992 |
Journal: | Operations Research |
Authors: | Sahindis N.V., Grossmann I.E. |
Keywords: | programming: integer |
The problem of selecting processes and capacity expansion policies for a chemical complex consisting of continuous chemical processes can be formulated as a multiperiod, mixed integer linear programming (MILP) problem. Based on a variable disaggregation technique which exploits lot sizing substructures, the authors propose two reformulations of the conventional MILP model. The first one is an NLP reformulation which very quickly yields good suboptimal solutions. The second is an MILP reformulation for exact solutions which leads to up to an order of magnitude faster computational results for large problems due to its tighter linear programming relaxation.