Certain types of quadratic programs with linear constraints have the property that an extreme point of the convex set of feasible solutions is an optimal solution. This paper presents a procedure for ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback