A new branch-and-bound algorithm for standard quadratic programming problems

2017 ◽  
Vol 34 (1) ◽  
pp. 79-97
Author(s):  
G. Liuzzi ◽  
M. Locatelli ◽  
V. Piccialli
Keyword(s):  
Quadratic Programming ◽  
Branch And Bound ◽  
Branch And Bound Algorithm ◽  
Quadratic Programming Problems

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

2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Yuelin Gao ◽  
Feifei Li ◽  
Siqiao Jin
Keyword(s):  
Lower Bound ◽  
Quadratic Programming ◽  
Branch And Bound ◽  
Numerical Experiments ◽  
Original Problem ◽  
Degree Of Approximation ◽  
Quadratic Constraints ◽  
Reduction Strategy ◽  
Optimal Value ◽  
Quadratic Programming Problems

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 degree of approximation and the convergence rate of acceleration, a rectangular reduction strategy is used in the algorithm. Numerical experiments show that the proposed algorithm is feasible and effective and can solve small- and medium-sized problems.

Unit Commitment Solution by Branch and Bound Algorithm

2020 ◽  
Author(s):  
Bishaljit Paul ◽  
Sushovan Goswami ◽  
Dipu Mistry ◽  
Chandan Kumar Chanda
Keyword(s):  
Branch And Bound ◽  
Unit Commitment ◽  
Branch And Bound Algorithm
Sign in / Sign up

Export Citation Format

Share Document