The linear complementarity problem (LCP) belongs to the class of NP-complete problems. Therefore we can not expect a polynomial time solution method for LCPs without requiring some special property of the matrix of the problem. We show that the dual LCP can be solved in polynomial time if the matrix is row sufficient, moreover in this case all feasible solutions are complementary. Furthermore we present an existentially polytime (EP) theorem for the dual LCP with arbitrary matrix.
|Number of pages||7|
|Journal||Operations Research Reports|
|Publication status||Published - 1 Feb 2007|
- linear complementarity problem
- polynominally solvable problems