ABSTRACT: This paper presents a new heuristic to linearise the convex quadratic programming problem. The usual Karush-Kuhn-Tucker conditions are used but in this case a linear objective function is ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results