Further Results on Multiparametric Quadratic Programming

摘要

In this paper we extend recent results on strictly convex multiparametric quadratic programming (mpQP) to the convex case. An efficient method for computing the mpQP solution is provided. We give a fairly complete description of the mpQP solver, focusing on implementational issues such as degeneracy handling.