On the simplex method and a class of linear complementarity problems

DOI10.1016/0024-3795(76)90057-4zbMath0332.90026OpenAlexW2143370902MaRDI QIDQ1228544

S. R. Mohan

Publication date: 1976

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(76)90057-4

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items

A polynomial algorithm for testing the nonnegativity of principal minors of Z-matrices, On testing nonnegativity of principal minors of \({\mathbf{Z}} \)-matrices using simplex method, Matrices and the linear complementarity problem, A class of polynomially solvable linear complementarity problems, Linear complementarity problems and characterizations of Minkowski matrices, On hidden \(\mathbf{Z}\)-matrices and the linear complementarity problem, Hidden Z-matrices with positive principal minors

Cites Work

• Unnamed Item
• Complementary pivot theory of mathematical programming
• On the number of solutions to the complementarity problem and spanning properties of complementary cones
• Some classes of matrices in linear complementarity theory
• Equilibrium Points of Bimatrix Games
• Bimatrix Equilibrium Points and Mathematical Programming
• The Approximation of Fixed Points of a Continuous Mapping
• The Linear Complementarity Problem