Abstract
In this work, we introduce a global optimization algorithm based on interval analysis for solving nonconvex Mixed Integer Nonlinear Programs (MINLPs). The algorithm is a generalization of the procedure proposed by the authors (Vaidyanathan and ElHalwagi, 1994a) for solving nonconvex Nonlinear Programs (NLPs) globally. The algorithm features several tools for accelerating the convergence to the global solution. A new discretization procedure is proposed within the framework of interval analysis for partitioning the search space. Furthermore, infeasible search spaces are eliminated without directly checking the constraints. Illustrative examples are solved to demonstrate the applicability of the proposed algorithm to solve nonconvex MINLPs efficiently.
This is a preview of subscription content, log in via an institution to check access.
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
Alefeld G. and J. Herzberger. 1983, “Introduction to Interval Computations”, Academic Press, New York.
Bagajewicz M. and V. Manousiouthakis. 1991, “On the Generalized Benders decomposition”, Computers chem. Engng, 15, 10.
Floudas C. A. and P. M. Pardalos. 1990, “A Collection of Test Problems for Constrained Global Optimization Algorithms”, Lecture Notes in Computer Science, pp. 29–30, Vol. 455. Springer-Verlag, New York.
Floudas C. A. and P. M. Pardalos. 1992, “Recent Advances in Global Optimization”, Princeton University Press, Princeton, New Jersey.
Floudas C. A. and V. Visweswaran. 1993, “A Primal-Relaxed Dual Global Optimization Approach”, J. Opt. Theory Applic, 78, 2, 87.
Floudas C. A. and I. E. Grossmann. 1994, “Algorithmic Approaches to Process Synthesis: Logic and Global Optimization”, Foundations of Computer-Aided Process Design, Snowmass Village, Colorado.
Geoffrion A. M. 1972, “Generalized Benders decomposition”, J. Opt. Theory Applic, 10, 237.
Hansen E. R. 1980, “Global Optimization Using Interval Analysis-the Multidimensional Case”, Numer. Math., 34, 247.
Hansen E. R. 1992, “Global Optimization Using Interval Analysis”, Marcel Dekker, Inc., New York.
Horst R. 1990, “Deterministic Methods in Constrained Global Optimization: Some Recent Advances and New Fields of Application”, Naval Res. Logist, 37, 433.
Ichida K. and Y. Fujii, “An Interval Arithmetic Method of Global Optimization”, Computing, 23, 85.
Kocis, G. R. and I. E. Grossmann. 1988, “Global Optimization of Nonconvex Mixed-Integer Nonlinear Programming (MINLP) Problems in Process Synthesis”, Ind. Eng. Chem. Res., 27, 1407.
Liebman J., L. Lasdon, L. Schrage and A. Waren. 1986, “Modeling and Optimization with GINO”, The Scientific Press, CA.
Manousiouthakis V. and D. Sourlas. 1992, “A Global Optimization Approach to Rationally Constrained Rationally Programming”, Chem. Engng Commun., 115, 127.
Maranas, C. D. and C. A. Floudas. 1994, “Global Minimum Potential Energy Conformations of Small Molecules”, Journal of Global Optimization, Vol. 4, No. 2, 135.
McCormick G. P. 1976, “Computability of Global Solutions to Factorable Nonconvex Programs: Part I-Convex Underestimation Problems”, Math. Prog., 10, 147.
Moore R. E. 1966, “Interval Analysis”, Prentice-Hall, Englewood cliffs, NJ.
Moore R. E. 1979, “Methods and Applications of Interval Analysis”, SIAM, Philadelphia.
Moore R., E. R. Hansen and A. Leclerc. 1992, “Rigorous Methods for Global Optimization”, Recent Advances in Global Optimization, (Edited by C. A. Floudas and P. M. Pardalos), p. 321. Princeton University Press, Princeton.
Ratschek H. and J. Rokne. 1984, “Computer Methods for the Range of Functions”, Ellis Horwood, Chichester.
Ratschek H and J. Rokne. 1991, “Interval Tools for Global Optimization”, Computers Math. applic., 21, 41.
Ryoo, H. S. and N. V. Sahinidis. 1993, “Global Optimization of Nonconvex NLPs and MINLPs with Applications in Process Design”, Technical Report, Department of Mechanical and Industrial Engineering, University of Illinois at Urbana-Champaign, Urbana, IL.
Sahinidis N. V. and I. E. Grossmann. 1991, “Convergence Properties of Generalized Benders decomposition”, Computers chem. Engng, 15, 481.
Sengupta S. 1981, “Global Nonlinear Constrained Optimization”, Ph.D. Dissertation, Washington State University.
Stephanopoulos G. and A. W. Westerberg. 1975, “The Use of Hestenes’ Method of Multipliers to Resolve Dual Gaps in Engineering System optimization”, JOTA, 15, 285.
Swaney, R. E. 1990, “Global Solution of Algebraic Nonlinear Programs”, AIChE Annual Meeting, Chicago, IL.
Vaidyanathan R. and M. El-Halwagi. 1994a, “Global Optimization of Non-convex Nonlinear Programs via Interval Analysis”, Computers chem. Engng, 18, 889.
Vaidyanathan R. and M. El-Halwagi. 1994b, “Bounding Methods of Interval Analysis for Global Optimization”, AIChE Annual Meeting, San Francisco.
Visweswaran V. and C. A. Floudas. 1990, “A Global Optimization Procedure (GOP) for Certain Classes of Nonconvex NLPs-II. Application of Theory and Test Problems”, Computers chem. Engng, 14, 1419.
Zwart P. B. 1974, “Global Maximization of a Convex Function with Linear Inequality Constraints”, Oper. Rea, 22, 602–609.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Vaidyanathan, R., El-Halwagi, M. (1996). Global Optimization of Nonconvex MINLP’s by Interval Analysis. In: Grossmann, I.E. (eds) Global Optimization in Engineering Design. Nonconvex Optimization and Its Applications, vol 9. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-5331-8_6
Download citation
DOI: https://doi.org/10.1007/978-1-4757-5331-8_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4754-3
Online ISBN: 978-1-4757-5331-8
eBook Packages: Springer Book Archive