Abstract
This paper presents a general overview of the global optimization algorithm by Quesada and Grossmann [6] for solving NLP problems involving linear fractional and bilinear terms, and it explores the use of alternative bounding approximations. These are applied in the global optimization of problems arising in different engineering areas and for which different relaxations are proposed depending on the mathematical structure of the models. These relaxations include linear and nonlinear underestimator problems. Reformulations that generate additional estimator functions are also employed. Examples from structural design, batch processes, portfolio investment and layout design are presented.
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
Floudas, C.A. and Pardalos, P.M. (1990). A Collection of Test Problems for Constrained Global Optimization Algorithms. Edited by G. Goss and J. Hartmanis, Springer Verlag.
Grossmann, I.E., Voudouris, V.T. and Ghattas, O. (1992). Mixed-Integer Linear Programming Reformulation for Some Nonlinear Discrete Design Optimization Problems. Recent Advances in Global Optimization (Floudas, C.A and Pardalos, P.M., eds.) Princeton University Press, Princeton, NJ, 478–512.
Horst, R. (1990). Deterministic Method in Constrained Global Optimization: Some Recent Advances and Fields of Application. Naval Research Logistics, 37, 433471.
Horst, R. and Tuy, T. (1990). Global Optimization: Deterministic Approaches. Springer-Verlag, Berlin, New York.
McCormick, G.P. (1976). Computability of Global Solutions to Factorable Nonconvex Programs: Part I–Convex Underestimating Problems. Mathematical Programming, 10, 146–175.
Quesada, I. and Grossmann, I.E. (1995). A Global Optimization Algorithm for Linear Fractional and Bilinear Programs. Journal of Global Optimization, 6, 3976
Quesada, I. and Grossmann, I.E. (1993). Global Optimization Algorithm for Heat Exchanger Networks. Ind. Eng. Chem. Research, 32, 487–499.
Sahinidis, N.V. (1993). Accelerating Branch and Bound in Continuous Global Optimization. TIMS/ORSA meeting, Phoenix, AZ paper MA 36. 2.
Sherali, H. D. and Alameddine, A. (1992). A New Reformulation-Linearization Technique for Bilinear Programming Problems. Journal of Global Optimization, 2, 379–410.
Swaney, R. E. (1990). Global Solution of Algebraic Nonlinear Programs. AIChE Meeting, Paper No. 22f.
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
Quesada, I., Grossmann, I.E. (1996). Alternative Bounding Approximations for the Global Optimization of Various Engineering Design Problems. 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_10
Download citation
DOI: https://doi.org/10.1007/978-1-4757-5331-8_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4754-3
Online ISBN: 978-1-4757-5331-8
eBook Packages: Springer Book Archive