A Reduced Space Branch and Bound Algorithm for Global optimization

Journal of Global Optimization

Volumn 11, Issue 3, 1997, Pages 287-311

  Epperly, Thomas G W ^a   Pistikopoulos, Efstratios N ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Branch and bound; Convex envelope; Global optimization; Reduced space

Indexed keywords

EID: 0012486714     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008212418949     Document Type: Article

References (24)

1. F. A. Al-Khayyal and J. E. Falk. Jointly constrained biconvex programming. Mathematics of Operations Research, 8(2):273-286, 1983.
2. I. P. Androulakis, C. D. Maranas, and C. A. Floudas. αBB: A global optimization method for general constrainted nonconvex problems. Journal of Global Optimization, 7(4):337-363, 1995.
3. T. G. W. Epperly and R. E. Swaney. Branch and bound for global NLP: New bounding LP. In Ignacio E. Grossmann (ed.), Global Optimization in Engineering Design, chapter 1. Kluwer, 1996.
4. J. E. Fak and R. M. Soland. An algorithm for separable nonconvex programming problems. Management Science, 15(9):550-569, 1969.
5. R. Horst. An algorithm for nonconvex programming. Mathematical Programming, 10:312-321, 1976.
6. R. Horst. Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reverse convex constraints, DC-programming, and Lipschitzian optimization. Journal of Optimization Theory and Application, 58(1):11-37, 1988.
7. R. Horst and N. V. Thoai. Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems. Journal of Optimization Theory and Applications, 74(3):469-486, 1992.
8. R. Horst and N. V. Thoai. Constraint decomposition algorithms in global optimization. Journal of Global Optimization, 5:333-348, 1994.
9. M. G. Ierapetritou and E. N. Pistikopoulos. Batch plant design and operations under uncertainty. Industrial & Engineering Chemistry Research, 35(2):772-787, 1996.
10. G. P. McCormick. Computability of global solutions to factorable nonconvex programs: Part I - Convex underestimating problems. Mathematical Programming, 10:147-175, 1976.
11. G. P. McCormick. Nonlinear Programming, Theory, Algorithms, and Applications. John Wiley & Sons, 1983.
12. B. A. Murtagh and M. A. Saunders. MINOS 5.1 user's guide. Technical Report SOL 83-20R, Systems Optimization Laboratory, Stanford University, Stanford, CA 94305-4022, 1987.
13. L. D. Muu. An algorithm for solving convex programs with an additional convex-concave constraint. Mathematical Programming, 61:75-87, 1993.
14. L. D. Muu and W. Oettli. Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems. Journal of Global Optimization, 3:377-391, 1993.
15. A. Neumaier. Interval Methods for Systems of Equations. Encyclopedia of Mathematics and Its Applications. Cambridge University Press, 1990.
16. A. T. Phillips and J. B. Rosen. A parallel algorithm for constrained concave quadratic global minimization. Mathematical Programming, 42:421-448, 1988.
17. T. Q. Phong, L. T. H. An, and P. D. Tao. Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems. Operations Research Letters, 17:215-220, 1995.
18. I. Quesada and I. E. Grossmann. A global optimization algorithm for linear fractional and bilinear programs. Journal of Global Optimization, 6:39-76, 1995.
19. H. S. Ryoo and N. V. Sahinidis. Global optimization of nonconvex NLPs and MINLPs with applications in process design. Computers and Chemical Engineering, 19(5):551-566, 1995.
20. H. D. Sherali and A. Alameddine. A new reformulation-linearization technique for bilinear programming problems. Journal of Global Optimization, 2:379-410, 1992.
21. H. D. Sherali and C. H. Tuncbilek. A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. Journal of Global Optimization, 2:101-112, 1992.
22. H. D. Sherali and C. H. Tuncbilek. A reformulation-convexification approach for solving nonconvex quadratic programming problems. Journal of Global Optimization, 7:1-31, 1995.
23. E. M. B. Smith and C. C. Pantelides. Global optimization of general process models. In Ignacio E. Grossmann, editor, Global Optimization in Engineering Design, chapter 12. Kluwer, 1996.
24. H. Tuy. Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms. Journal of Global Optimization, 1(1):23-36, 1991.