A simple procedure for solving a continuous quadratic mathematical model

摘要

A new efficient procedure for solving a class of continuous linearly constrained quadratic problems is presented. It is based on the use of surrogate multipliers to construct an equivalent knapsack problem that is easier to solve, and a greedy-like procedure to solve it. This procedure is applicable in developing efficient branch and bound algorithms, by computing upper (lower) bounds for a quadratic integer problem.