A class of linear complementarity problems solvable in polynomial time
- 1 July 1991
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 152, 3-17
- https://doi.org/10.1016/0024-3795(91)90264-w
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Error bounds for the linear complementarity problem with a P-matrixLinear Algebra and its Applications, 1990
- Interior path following primal-dual algorithms. part I: Linear programmingMathematical Programming, 1989
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- Sufficient matrices and the linear complementarity problemLinear Algebra and its Applications, 1989
- Linear complementarity problems solvable by a polynomially bounded pivoting algorithmPublished by Springer Nature ,1985
- Linear complementarity problems solvable by A single linear programMathematical Programming, 1976
- Some classes of matrices in linear complementarity theoryMathematical Programming, 1973
- A Characterization of the Constant Parity Property of the Number of Solutions to the Linear Complementarity ProblemSIAM Journal on Applied Mathematics, 1972
- On the number of solutions to the complementarity problem and spanning properties of complementary conesLinear Algebra and its Applications, 1972
- The Linear Complementarity ProblemManagement Science, 1971