Multiparametric Linear Complementarity Problems
The linear complementarity problem (LCP) is a general problem that unifies linear and quadratic programs and bimatrix games. In this paper, we present an efficient algorithm for the solution to multiparametric linear complementarity problems (pLCPs) that are defined by positive semi-definite matrices. This class of problems includes the multiparametric linear (pLP) and semi-definite quadratic programs (pQP), where parameters are allowed to appear linearly in the cost and the right hand side of the constraints. We demonstrate that the proposed algorithm is equal in efficiency to the best of current pLP and pQP solvers for all problems that they can solve, and yet extends to a much larger class
04177564.pdf
Publisher's version
restricted
197.47 KB
Adobe PDF
35b0fd7f8479bfd4cf9b15889c6442f0
publication_2472.pdf
Preprint
openaccess
117.64 KB
Adobe PDF
cfb7b931f2b18f986d72b46da7935d3b