On characterizing linear complementarity problems as linear programs
From MaRDI portal
Publication:3471881
DOI10.1080/02331938908843492zbMath0695.90092OpenAlexW2042813889MaRDI QIDQ3471881
Publication date: 1989
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331938908843492
Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A characterization of an \(n\) by \(2n\) ``\(Q_0\)-matrix, \(\mathcal L\)-matrices and solvability of linear complementarity problems by a linear program, Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
Cites Work
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes \(Q\) and \(Q_ 0\)
- Jointly Constrained Biconvex Programming
- A constructive characterization ofQ o-matrices with nonnegative principal minors
- An implicit enumeration procedure for the general linear complementarity problem
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Programs
- A cutting plane algorithm for solving bilinear programs
- Linear complementarity problems solvable by A single linear program
- 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
