Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Programs

Related Items

Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods ⋮ On properties of several refinements of optimal solutions in linear programming ⋮ On characterizing linear complementarity problems as linear programs ⋮ 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 ⋮ \(\mathcal L\)-matrices and solvability of linear complementarity problems by a linear program ⋮ 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 ⋮ On hidden \(\mathbf{Z}\)-matrices and the linear complementarity problem ⋮ The linear complementarity problem as a separable bilinear program ⋮ Some perturbation results for the Linear Complementarity Problem ⋮ A note on sufficient conditions for \(Q_ 0\) and \(Q_ 0\cap P_ 0\) matrices ⋮ Linear, quadratic, and bilinear programming approaches to the linear complementarity problem