On the simplex method and a class of linear complementarity problems

DOI10.1016/0024-3795(76)90057-4MaRDI QIDQ1228544zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3212891 (Why is no real title available?)
• Bimatrix Equilibrium Points and Mathematical Programming
• Complementary pivot theory of mathematical programming
• Equilibrium Points of Bimatrix Games
• On the number of solutions to the complementarity problem and spanning properties of complementary cones
• Some classes of matrices in linear complementarity theory
• The Approximation of Fixed Points of a Continuous Mapping
• The Linear Complementarity Problem

Cited in

(7)

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

This page was built for publication: On the simplex method and a class of linear complementarity problems

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