Two counterexamples on the polynomial solvability of the linear complementarity problem

DOI10.1007/BF02592069MaRDI QIDQ3809598zbMATH OpenOpenAlexWikidataFDO

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

Publication date 1987

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02592069

zbMATH Keywords

linear coplementarityp-matrixparametric principal pivoting algorithmpolynomial solvability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
• A polynomial-time algorithm for a class of linear complementarity problems
• Pivoting in linear complementarity: Two polynomial-time cases
• Extended \(P\)-pairs
• scientific article; zbMATH DE number 3982937

Cites work

• scientific article; zbMATH DE number 3850827 (Why is no real title available?)
• scientific article; zbMATH DE number 3677572 (Why is no real title available?)
• Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
• Monotone solutions of the parametric linear complementarity problem
• Strongly polynomial algorithm for a class of combinatorial LCPs

Cited in

(5)

• Extended \(P\)-pairs
• Pivoting in linear complementarity: Two polynomial-time cases
• Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
• Enumeration of PLCP-orientations of the 4-cube
• On solvability of the complex linear complementarity problem

This page was built for publication: Two counterexamples on the polynomial solvability of the linear complementarity problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3809598)