Article ID Journal Published Year Pages File Type
1143203 Operations Research Letters 2008 4 Pages PDF
Abstract
Given an optimal solution for a convex quadratic programming (QP) problem, the optimal partition of the QP can be computed by solving a pair of linear or QP problems for which nearly optimal solutions are known.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Identifying the optimal partition in convex quadratic programming
Authors
,