Accelerating Convergence of Branch-and-Bound Algorithms For Quadratically Constrained Optimization Problems

  • Tim Van Voorhis
  • Faiz Al-Khayyal
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 7)


We consider methods for finding global solutions to quadratically constrained programs. We present a branch-and-bound algorithm which solves a sequence of linear programs, each of which approximates the original problem over a hyperrectangular region. Tightening the bounds produces arbitrarily tight approximations as the volume of the hyperrectangle decreases. Computational experiments are given which relate the efficiency of the algorithm to the input parameters. In order to reduce the amount of work necessary to isolate global solutions within a small region, local optimization techniques are embedded within the branch-and-bound scheme. In particular, the use of the interval Newton method applied to the KKT system is discussed and shown to be computationally beneficial. Extensions are considered which allow the branch-and- bound algorithm to process more general nonlinear functions than quadratic.


Quadratic constraints branch-and-bound linear relaxation interval Newton 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adams, W.P. and Sherali, H.D., 1990, Linearization strategies for a class of zero-one mixed integer programming problems, Operations Research 38, 217–266.MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Al-Khayyal, F.A. and Falk, J.E., 1983, Jointly constrained biconvex programming, Mathematics of Operations Research 8, 273–286.MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Al-Khayyal, F.A. and Larsen, C., 1990, Global optimization of a quadratic function subject to a bounded mixed integer constraint set, Annals of Operations Research 25, 169–180.MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Al-Khayyal, F.A., Larsen, C. and Van Voorhis, T., 1995, A relaxation method for nonconvex quadratically constrained quadratic programs, Journal of Global Optimization 6, 215–230.zbMATHCrossRefGoogle Scholar
  5. 5.
    Avram, F. and Wein, L.M., 1992, A product design problem in semiconductor manufacturing, Operations Research 40, 999–1017.CrossRefGoogle Scholar
  6. 6.
    Balakrishnan, J.,Jacobs, F.R.,and Venkataramanan, M.A., 1992, Solutions for the constrained dynamic facility layout problem, European Journal of Operational Research 57, 280–286.zbMATHCrossRefGoogle Scholar
  7. 7.
    Denardo, E.V. and Tang, C.S., 1992, Linear control of a Markov production system, Operations Research 40, 259–278.zbMATHCrossRefGoogle Scholar
  8. 8.
    Eben-Chaime, M ., 1990, The physical design of printed circuit boards: A mathematical programming approach, Ph.D. Thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia, 30332.Google Scholar
  9. 9.
    Floudas, C.A. and Visweswaran, V., 1990, A global optimization algorithm (GOP) for cetain classes of nonconvex NLPs: II. Application of theory and test problems, Computers & Chemical Engineering 14, 1419–1434.CrossRefGoogle Scholar
  10. 10.
    Hansen, P., Jaumard, B., and Lu, S.H., 1991, An analytical approach to global optimization, Mathematical Programming 52, 227–254.MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Hum, S.H. and Sarin, R.K., 1991, Simultaneous product-mix planning, lot sizing and scheduling at bottleneck facilities, Operations Research 39, 296–307.zbMATHCrossRefGoogle Scholar
  12. 12.
    Juel, H. and Love, R.F., 1992, The dual of a generalized minimax location problem, Annals of Operations Research 40, 261–264.MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Pardalos, P.M. and Vavasis, S. A., 1991, Quadratic programming with one negative eigenvalue is NP-hard, Journal of Global Optimization 1, 15–22.MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Pierre, D.A. and Lowe, M.J., 1975. Mathematical Programming Via Augmented Lagrangians, Addison-Wesley Publishing Company, Reading, Massachusetts.zbMATHGoogle Scholar
  15. 15.
    Pourbabai, B. and Seidmann, A., 1992, Routing and buffer allocation models for a telecom-munication system with heterogeneous devices, European Journal of Operational Research 63, 423–431.zbMATHCrossRefGoogle Scholar
  16. 16.
    Press, W.H., Teukolsky, S.A., Vetterling, W.T., and Flannery, B.P., 1988, Numerical Recipes in C, Cambridge University Press, Cambridge.zbMATHGoogle Scholar
  17. 17.
    Ryoo, H.S. and Sahinidis, N.V., 1994, A branch-and-reduce approach to global optimization, Working Paper, Department of Mechanical & Industrial Engineering, University of Illinois, Urbana-Champaign, 1206 W. Green Street, Urbana, IL, 61801.Google Scholar
  18. 18.
    Sherali, H.D. and Tuncbilek, C.H., 1992, A global optimization algorithm for polynomial programming programs using a reformulation-linearization technique, Journal of Global Op-timization 2, 101– 112.MathSciNetGoogle Scholar
  19. 19.
    Tuncbilek. C ., 1994, Polynomial and indefinite quadratic programming problems: Algorithms and applications, Ph.D. Thesis, Department of Industrial and Systems Engineering, Virginia Poly technical Institute and State University, Blacksburg, Virginia, 24061.Google Scholar
  20. 20.
    Weintraub, A. and Vera, J., 1991, A cutting plane approach for chance constrained linear programs, Operations Research 39, 776–785.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • Tim Van Voorhis
    • 1
  • Faiz Al-Khayyal
    • 1
  1. 1.School of Industrial and Systems EngineeringGeorgia Institute of TechnologyAtlantaUSA

Personalised recommendations