Characterization of linear complementarity problems as linear programs
From MaRDI portal
Publication:4159160
Cited in
(32)- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- Iterative methods for a class of complementarity problems
- Matrices and the linear complementarity problem
- On spherically convex sets and Q-matrices
- 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
- Linear complementarity problems and characterizations of Minkowski matrices
- Hidden Z-matrices with positive principal minors
- The implicit general order complementarity problem, models and iterative methods
- A note on sufficient conditions for \(Q_ 0\) and \(Q_ 0\cap P_ 0\) matrices
- Bilinear separation of two sets in n-space
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
- Misclassification minimization
- A characterization of an \(n\) by \(2n\) ``\(Q_0\)-matrix
- Total dual integrality and integral solutions of the linear complementarity problem
- Almost \(P_ 0\)-matrices and the class \(Q\)
- A finite improvement algorithm for the linear complementarity problem
- An algebra-based approach for linearly constrained concave minimization
- A new concave minimization algorithm for the absolute value equation solution
- M-matrix and inverse M-matrix extensions
- On characterizing linear complementarity problems as linear programs
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- A note on an open problem in linear complementarity
- Application of disjunctive programming to the linear complementarity problem
- On hidden \(\mathbf{Z}\)-matrices and the linear complementarity problem
- On solving a larger subclass of linear complementarity problems by Lemke's method
- On some special matrices and their applications in linear complementarity problem
- On cone orderings and the linear complementarity problem
- Absolute value equations
- Vector equilibrium problems, minimal element problems and least element problems
- Equivalence of equilibrium problems and least element problems
This page was built for publication: Characterization of linear complementarity problems as linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4159160)