Linear complementarity problems solvable as linear programs
From MaRDI portal
Recommendations
- Linear complementarity problems solvable by A single linear program
- A quadratic programming view of the linear complementary problem
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- \(\mathcal L\)-matrices and solvability of linear complementarity problems by a linear program
- Linear complementarity as a general solution method to combinatorial problems
Cited in
(16)- An LP-based successive overrelaxation method for linear complementarity problems
- Acceptable solutions of linear complementarity problems
- Linear programs for constraint satisfaction problems
- Investigations of a certain class of linear complementarity problems
- \(\mathcal L\)-matrices and solvability of linear complementarity problems by a linear program
- Reducing horizontal linear complementarity problems
- A class of polynomially solvable linear complementarity problems
- A quadratic programming view of the linear complementary problem
- Linear complementarity as a general solution method to combinatorial problems
- Solving the linear complementarity problem through concave programming
- The Linear Complementarity Problems with a Few Variables per Constraint
- On characterizing linear complementarity problems as linear programs
- Linear complementarity problems solvable by integer programming
- Linear complementarity problems solvable by A single linear program
- scientific article; zbMATH DE number 819136 (Why is no real title available?)
- Application of disjunctive programming to the linear complementarity problem
This page was built for publication: 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 Q4971932)
