Summary
The solution of mixed-integer nonlinear programming (MINLP) problems often suffers from a lack of robustness, reliability, and efficiency due to the combined computational challenges of the discrete nature of the decision variables and the nonlinearity or even nonconvexity of the equations. By means of a continuous reformulation, the discrete decision variables can be replaced by continuous decision variables and the MINLP can then be solved by reliable NLP solvers. In this work, we reformulate 98 representative test problems of the MINLP library MINLPLib with the help of Fischer-Burmeister (FB) NCP-functions and solve the reformulated problems in a series of NLP steps while a relaxation parameter is reduced. The solution properties are compared to the MINLP solution with branch & bound and outer approximation solvers. Since a large portion of the reformulated problems yield local optima of poor quality or cannot even be solved to a discrete solution, we propose a reinitialization and a post-processing procedure. Extended with these procedures, the reformulation achieved a comparable performance to the MINLP solvers SBB and DICOPT for the 98 test problems. Finally, we present a large-scale example from synthesis of distillation systems which we were able to solve more efficiently by continuous reformulation compared to MINLP solvers.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lastusilta T, Bussieck M R, Westerlund T (2009) Ind Eng Chem Res 48:7337
Bonami P, Biegler L T, Conn A R, Cornuejols G, Grossmann I E, Laird C D, Lee J, Lodi A, Margot F, Sawaya N, Waechter A (2005) IBM Res Rep RC23771
Viswanathan J, Grossmann, I E (1990) Comput Chem Eng 14:769–782
Gupta O K, Ravindran V (1985) Manage Sci 31:1533–1546
Fletcher R, Leyffer S (2004) Optim Method Softw 19:15–40
Stein O, Oldenburg J, Marquardt W (2004) Comput Chem Eng 28:1951–1966
Kraemer K, Kossack S, Marquardt W (2007) In: Plesu V, Agachi P S (eds) 17th European Symposium on Computer Aided Process Engineering. Elsevier.
Scheel H, Scholtes S (2000) Math Oper Res 25:1–22
Baumrucker BT, Renfro JG, Biegler LT (2007) Comp Chem Eng 32:2903–2913
Bussieck M R, Drud A S, Meeraus A (2003) INFORMS J. Comput 15:114–119
Brooke A, Kendrick D, Meeraus A, Raman R (2005) GAMS - A Users Guide. GAMS Development Corporation, Washington
Drud A, (2005) SBB. In: GAMS - The Solver Manuals. GAMS Development Corporation, Washington
Grossman I E, Viswanathan J, Vecchietti A, Raman R, Kalvelagen E (2008) DICOPT. In: GAMS - The Solver Manuals. GAMS Corporation, Washington
Gill P, Murray W, Saunders M, Drud A, Kalvelagen E (2008) SNOPT. In: GAMS - The Solver Manuals. GAMS Development Corporation, Washington
Kraemer K, Kossack S, Marquardt W (2009) Ind Eng Chem Res 48:6749–6764
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer -Verlag Berlin Heidelberg
About this paper
Cite this paper
Kraemer, K., Marquardt, W. (2010). Continuous Reformulation of MINLP Problems. In: Diehl, M., Glineur, F., Jarlebring, E., Michiels, W. (eds) Recent Advances in Optimization and its Applications in Engineering. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12598-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-12598-0_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12597-3
Online ISBN: 978-3-642-12598-0
eBook Packages: EngineeringEngineering (R0)