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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results