Characterization of linear complementarity problems as linear programs

Related Items

Deterministic methods in constrained global optimization: Some recent advances and new fields of application, An algebra-based approach for linearly constrained concave minimization, A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, Misclassification minimization, Iterative methods for a class of complementarity problems, Global minimization of large-scale constrained concave quadratic problems by separable programming, On characterizing linear complementarity problems as linear programs, Absolute value equations, A characterization of an \(n\) by \(2n\) ``\(Q_0\)-matrix, Vector equilibrium problems, minimal element problems and least element problems, Matrices and the linear complementarity problem, On spherically convex sets and \(Q\)-matrices, M-matrix and inverse M-matrix extensions, 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, Equivalence of equilibrium problems and least element problems, Application of disjunctive programming to the linear complementarity problem, A note on an open problem in linear complementarity, Total dual integrality and integral solutions of the linear complementarity problem, Linear complementarity problems and characterizations of Minkowski matrices, On hidden \(\mathbf{Z}\)-matrices and the linear complementarity problem, Almost \(P_ 0\)-matrices and the class \(Q\), A new concave minimization algorithm for the absolute value equation solution, Hidden Z-matrices with positive principal minors, On cone orderings and the linear complementarity problem, A finite improvement algorithm for the linear complementarity problem, 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, Linear, quadratic, and bilinear programming approaches to the linear complementarity problem