Abstract: In this work, we extend the simplex algorithm of linear programming for finding a local minimum of a concave quadratic function subject to box constraints. In order to test the performance ...
This is a preview. Log in through your library . Abstract A computational procedure based on the results of Barankin and Dorfman [1], for minimising a convex quadratic function subject to linear ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results