Advertisement

New Formulations and Branching Strategies for the GOP Algorithm

  • V. Visweswaran
  • C. A. Floudas
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 9)

Abstract

In Floudas and Visweswaran (1990, 1993), a deterministic global optimization approach was proposed for solving certain classes of nonconvex optimization problems. A global optimization algorithm, GOP, was presented for the solution of the problem through a series of primal and relaxed dual problems that provide valid upper and lower bounds respectively on the global solution. The algorithm was proven to have finite convergence to an r-global optimum. In this paper, a branch-and-bound framework of the GOP algorithm is presented, along with several reduction tests that can be applied at each node of the branch-and-bound tree. The effect of the properties is to prune the tree and provide tighter underestimators for the relaxed dual problems. We also present a mixed-integer linear programming (MILP) formulation for the relaxed dual problem, which enables an implicit enumeration of the nodes in the branch-and-bound tree at each iteration. Finally, an alternate branching scheme is presented for the solution of the relaxed dual problem through a linear number of subproblems. Simple examples are presented to illustrate the new approaches. Detailed computational results on the implementation of both versions of the algorithm can be found in the companion paper in chapter 4.

Keywords

Dual Problem Mixed Integer Linear Program Lagrange Function Primal Problem Global Optimization Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. [1]
    F. A. Al-Khayyal and J. E. Falk. Jointly constrained biconvex programming. Math. of Oper. Res., 8 (2): 273, 1983.MathSciNetzbMATHCrossRefGoogle Scholar
  2. [2]
    F. Archetti and F. Schoen. A Survey on the Global Optimization Problem: General Theory and Computational Approaches. Annals of Operations Research, 1: 87, 1984.CrossRefGoogle Scholar
  3. [3]
    B. R. Barmish, C. A. Floudas, H. V. Hollot, and R. Tempo. A Global Linear Programming Solution to Some Open Robustness Problems Including Matrix Polytope Stability. IEEE Transactions on Automatic Control,1995a. Submitted for Publication.Google Scholar
  4. [4]
    B. R. Barmish, C. A. Floudas, H. V. Hollot, and R. Tempo. A Global Linear Programming Solution to Some Open Robustness Problems Including Matrix Polytope Stability. Proceedings of the ACC 95, Seattle, June 21–23, 1995b. To appear.Google Scholar
  5. [5]
    L.C.W. Dixon and G.P. Szego. Towards global optimisation. North-Holland, Amsterdam, 1975.zbMATHGoogle Scholar
  6. [6]
    L.C.W. Dixon and G.P. Szego. Towards global optimisation 2. North-Holland, Amsterdam, 1978.zbMATHGoogle Scholar
  7. [7]
    M. A. Duran and I. E. Grossmann. An outer approximation algorithm for a class of mixed-integer nonlinear programs. Mathematical Programming, 36: 307, 1986.MathSciNetzbMATHCrossRefGoogle Scholar
  8. [8]
    C. A. Floudas, A. Aggarwal, and A. R. Ciric. Global optimum search for nonconvex NLP and MINLP problems. Comp. and Chem. Eng., 13 (10): 1117, 1989.CrossRefGoogle Scholar
  9. [9]
    C. A. Boudas and P. M. Pardalos. A Collection of Test Problems for Constrained Global Optimization Algorithms, volume 455 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany, 1990.Google Scholar
  10. [10]
    C. A. Boudas and P. M Pardalos. Recent Advances in Global Optimization. Princeton Series in Computer Science. Princeton University Press, Princeton, New Jersey, 1992.Google Scholar
  11. [11]
    C. A. Boudas and V. Visweswaran. A global optimization algorithm (GOP) for certain classes of nonconvex NLPs: I. theory. Comp. & Chem. Eng., 14: 1397, 1990.CrossRefGoogle Scholar
  12. [12]
    C. A. Floudas and V. Visweswaran. A primal-relaxed dual global optimization approach. J. Optim. Theory and Appl., 78 (2): 187, 1993.MathSciNetzbMATHCrossRefGoogle Scholar
  13. [13]
    A. M. Geoffrion. Generalized Benders Decomposition. J. Optim. Theory and Appl., 10 (4): 237, 1972.MathSciNetzbMATHCrossRefGoogle Scholar
  14. [14]
    R. Horst and H. Tuy. Global Optimization: Deterministic Approaches. Springer-Verlag, Berlin, Germany, 1990.Google Scholar
  15. [15]
    W. B. Liu and C. A. Floudas. A Remark on the GOP Algorithm for Global Optimization. J. Global Optim., 3: 519, 1993.MathSciNetzbMATHCrossRefGoogle Scholar
  16. [16]
    W. B. Liu and C. A. Floudas. Convergence of the GOP Algorithm for a Large Class of Smooth Optimization Problems. Journal of Global Optimization, 6: 207, 1995.MathSciNetzbMATHCrossRefGoogle Scholar
  17. [17]
    J. Mockus. Bayesian Approach to Global Optimization. Kluwer Academic Publishers, Amsterdam, Holland, 1989.CrossRefGoogle Scholar
  18. [18]
    P. M. Pardalos and J. B. Rosen. Constrained global optimization: Algorithms and applications, volume 268 of Lecture Notes in Computer Science. Springer Verlag, Berlin, Germany, 1987.CrossRefGoogle Scholar
  19. [19]
    P.M. Pardalos and J.B. Rosen. Methods for global concave minimization: A bibliographic survey. SIAM Review, 28 (3): 367, 1986.MathSciNetzbMATHCrossRefGoogle Scholar
  20. [20]
    A. Tom and A. Zilinskas. Global Optimization, volume 350 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany, 1989.Google Scholar
  21. [21]
    V. Visweswaran and C. A. Floudas. A Global optimization algorithm (GOP) for certain classes of nonconvex NLPs: II. Application of theory and test problems. Comp. and Chem. Eng., 14: 1419, 1990.CrossRefGoogle Scholar
  22. [22]
    V. Visweswaran and C. A. Floudas. New properties and computational improvement of the GOP algorithm for problems with quadratic objective function and onstraints. J. Global Optim., 3 (3): 439, 1993.MathSciNetzbMATHCrossRefGoogle Scholar
  23. [23]
    V. Visweswaran and C. A. Floudas. cGOP: A User’s Guide. Princeton University, Princeton, New Jersey, 1995a.Google Scholar
  24. [24]
    V. Visweswaran and C. A. Floudas. Computational Results For an Efficient Implementation of the GOP Algorithm and Its Variants. In Global Optimization in Engineering Design, (Ed.) I. E. Grossmann, Kluwer Book Series in Nonconvex Optimization and Its Applications, Chapter 4, 1995b.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1996

Authors and Affiliations

  • V. Visweswaran
    • 1
  • C. A. Floudas
    • 2
  1. 1.Mobil Research and Development CorporationPrincetonUSA
  2. 2.Department of Chemical EngineeringPrinceton UniversityPrincetonUSA

Personalised recommendations