A new efficient procedure for solving a class of continuous linearly constr
ained quadratic problems is presented, It is based on the use of surrogate
multipliers to construct an equivalent knapsack problem that is easier to s
olve, and a greedy-like procedure to solve it, This procedure is applicable
in developing efficient branch and bound algorithms, by computing upper (l
ower) bounds for a quadratic integer problem. (C) 2000 Elsevier Science Inc
. All rights reserved.