A Branch and Bound Reduced Algorithm for Quadratic Programming Problems with Quadratic Constraints

We propose a branch and bound reduced algorithm for quadratic programming problems with quadratic constraints. In this algorithm, we determine the lower bound of the optimal value of original problem by constructing a linear relaxation programming problem. At the same time, in order to improve the d...

Full description

Bibliographic Details
Main Authors: Yuelin Gao, Feifei Li, Siqiao Jin
Format: Article
Language:English
Published: Hindawi Limited 2013-01-01
Series:Mathematical Problems in Engineering
Online Access:http://dx.doi.org/10.1155/2013/594693

Similar Items