Two counterexamples on the polynomial solvability of the linear complementarity problem

DOI10.1007/BF02592069zbMath0659.90083WikidataQ124974772 ScholiaQ124974772MaRDI QIDQ3809598

Jong-Shi Pang, R. Chandrasekaran, Richard E. Stone

Publication date: 1987

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

polynomial solvability; parametric principal pivoting algorithm; linear coplementarity; p-matrix

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)