|
|||||
|
|
Optimal storage design for a multi-product plant: A non-convex MINLP formulation |
|
| Authors: | Steffen Rebennack Josef Kallrath Panos M Pardalos |
| Affiliation: | a Department of Industrial & Systems Engineering, Center for Applied Optimization, University of Florida, Gainesville, FL 32611, USA b Department of Astronomy, University of Florida, Gainesville, FL 32611, USA c BASF SE, Scientific Computing (GVC/S), D-67056 Ludwigshafen, Germany |
| Abstract: | We discuss a tank design problem for a multi product plant, in which the optimal cycle time and the optimal campaign size are unknown. A mixed-integer nonlinear programming (MINLP) formulation is presented, where non-convexities are due to the tank investment cost, storage cost, campaign setup cost and variable production rates. The objective of the optimization model is to minimize the sum of the production cost per ton per product produced. A continuous-time mathematical programming formulation is proposed and several extensions are discussed. The model is implemented in GAMS and computational results are reported for the two global MINLP solver BARON and LINDOGlobal as well as several nonlinear solvers available in GAMS. |
| Keywords: | Mixed-integer nonlinear programming Global optimization Storage design Cycle time Campaign length Lot sizing problem Continuous-time model |
| 本文献已被 ScienceDirect 等数据库收录！ | |