Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes \(Q\) and \(Q_ 0\)
From MaRDI portal
Publication:1177232
DOI10.1007/BF01586936zbMath0746.90074MaRDI QIDQ1177232
Publication date: 26 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Related Items
Characterizing \(Q\)-matrices beyond \(L\)-matrices ⋮ On characterizing linear complementarity problems as linear programs ⋮ A characterization of an \(n\) by \(2n\) ``\(Q_0\)-matrix ⋮ A note on sufficient conditions for \(Q_ 0\) and \(Q_ 0\cap P_ 0\) matrices
Cites Work
- Unnamed Item
- An experimental investigation of enumerative methods for the linear complementarity problem
- Q-matrices and spherical geometry
- On spherically convex sets and \(Q\)-matrices
- Some generalizations of positive definiteness and monotonicity
- Complementary pivot theory of mathematical programming
- A note onQ-matrices
- A constructive characterization ofQ o-matrices with nonnegative principal minors
- An implicit enumeration procedure for the general linear complementarity problem
- A finite characterization ofK-matrices in dimensions less than four
- Global Optimization Approach to the Linear Complementarity Problem
- Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Programs
- A Partial Characterization of a Class of Matrices Defined by Solutions to the Linear Complementarity Problem
- A note on an open problem in linear complementarity
- Characterization of linear complementarity problems as linear programs
- On solving linear complementarity problems as linear programs
- Some classes of matrices in linear complementarity theory
- Application of disjunctive programming to the linear complementarity problem
- Bimatrix Equilibrium Points and Mathematical Programming
- The Linear Complementarity Problem
- On the Alass of Complementary Cones and Lemke’s Algorithm
- The complementarity problem
