Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Programs
From MaRDI portal
Cited in
(16)- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
- Matrices and the linear complementarity problem
- Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes \(Q\) and \(Q_ 0\)
- The equivalence of an LCP to a parametric linear program with a scalar parameter
- A note on sufficient conditions for \(Q_ 0\) and \(Q_ 0\cap P_ 0\) matrices
- A characterization of an \(n\) by \(2n\) ``\(Q_0\)-matrix
- \(\mathcal L\)-matrices and solvability of linear complementarity problems by a linear program
- The linear complementarity problem as a separable bilinear program
- On characterizing linear complementarity problems as linear programs
- Some perturbation results for the Linear Complementarity Problem
- On hidden \(\mathbf{Z}\)-matrices and the linear complementarity problem
- On some special matrices and their applications in linear complementarity problem
- On properties of several refinements of optimal solutions in linear programming
- Vector equilibrium problems, minimal element problems and least element problems
- Equivalence of equilibrium problems and least element problems
This page was built for publication: Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3887268)
