Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.


Multiparametric Linear Complementarity Problems


C.N. Jones

IEEE Conference on Decision and Control

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.


Type of Publication:


File Download:

Request a copy of this publication.
(Uses JavaScript)
% No recipe for automatically generating a BibTex entry for (06)Talk
Permanent link