Alternative Bounding Approximations for the Global Optimization of Various Engineering Design Problems
This paper presents a general overview of the global optimization algorithm by Quesada and Grossmann  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.
KeywordsFeasible Region Layout Design Truss Structure Global Optimization Algorithm Convex Envelope
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- 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.Google Scholar
- Horst, R. (1990). Deterministic Method in Constrained Global Optimization: Some Recent Advances and Fields of Application. Naval Research Logistics, 37, 433471.Google Scholar
- Horst, R. and Tuy, T. (1990). Global Optimization: Deterministic Approaches. Springer-Verlag, Berlin, New York.Google Scholar
- Sahinidis, N.V. (1993). Accelerating Branch and Bound in Continuous Global Optimization. TIMS/ORSA meeting, Phoenix, AZ paper MA 36. 2.Google Scholar
- Swaney, R. E. (1990). Global Solution of Algebraic Nonlinear Programs. AIChE Meeting, Paper No. 22f.Google Scholar