A method for solving the general parametric linear complementarity problem

Author: Li Zukui  

Publisher: Springer Publishing Company

ISSN: 0254-5330

Source: Annals of Operations Research, Vol.181, Iss.1, 2010-12, pp. : 485-501

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

This paper presents a solution method for the general (mixed integer) parametric linear complementarity problem pLCP(q</i>(</i>),M</i>), where the matrix M</i> has a general structure and integrality restriction can be enforced on the solution. Based on the equivalence between the linear complementarity problem and mixed integer feasibility problem, we propose a mixed integer programming formulation with an objective of finding the minimum 1-norm solution for the original linear complementarity problem. The parametric linear complementarity problem is then formulated as multiparametric mixed integer programming problem, which is solved using a multiparametric programming algorithm. The proposed method is illustrated through a number of examples.