The P-matrix linear complementarity problem: generalizations and specializations
Leo Rüst · Repository for Publications and Research Data (ETH Zurich) · 2007
The goal of this thesis is to give a better understanding of the linear complementarity problem with a P-matrix (PLCP).Finding a polyno- mial time algorithm for the PLCP is a longstandingopen problem.Such an algorithm would settle the complexity status of many problems re- ducing to the PLCP.Most of the papers dealing with the PLCP look at it from an algebraic point of view.We analyze the combinatorial structure of the PLCP.