Journal of Global Optimization

, Volume 33, Issue 3, pp 313–336

Decomposition Methods for Solving Nonconvex Quadratic Programs via Branch and Bound*



The aim of this paper is to suggest branch and bound schemes, based on a relaxation of the objective function, to solve nonconvex quadratic programs over a compact polyhedral feasible region. The various schemes are based on different d.c. decomposition methods applied to the quadratic objective function. To improve the tightness of the relaxations, we also suggest solving the relaxed problems with an algorithm based on the so called “optimal level solutions” parametrical approach.


Branch and bound d.c. Decomposition Quadratic programming 

AMS Mathematics Subject Classification (2000)

90C20 90C26 90C31 

JEL Classification System (1999)

C61 C63 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2005

Authors and Affiliations

  1. 1.Department of Statistics and Applied MathematicsUniversity of PisaPisaItaly

Personalised recommendations