On characterizing linear complementarity problems as linear programs

DOI10.1080/02331938908843492MaRDI QIDQ3471881zbMATH OpenOpenAlexFDO

Authors Faiz Al-Khayyal

Publication date 1989

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331938908843492

zbMATH Keywords

linear complementarity problembilinear formulation

Mathematics Subject Classification ID

Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Publication:5753757
• Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
• The linear complementarity problem as a separable bilinear program
• Linear complementarity problems solvable by A single linear program
• Linear complementarity problems solvable as linear programs

Cites work

• A constructive characterization ofQ o-matrices with nonnegative principal minors
• A cutting plane algorithm for solving bilinear programs
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
• A note on an open problem in linear complementarity
• An implicit enumeration procedure for the general linear complementarity problem
• Characterization of linear complementarity problems as linear programs
• Jointly Constrained Biconvex Programming
• Linear complementarity problems solvable by A single linear program
• 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\)
• On solving linear complementarity problems as linear programs
• Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Programs

Cited in

(6)

• \(\mathcal L\)-matrices and solvability of linear complementarity problems by a linear program
• Comments on: Algorithms for linear programming with linear complementarity constraints
• Comments on: Algorithms for linear programming with linear complementarity constraints
• A characterization of an \(n\) by \(2n\) ``\(Q_0\)-matrix
• Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
• scientific article; zbMATH DE number 4185418 (Why is no real title available?)

This page was built for publication: On characterizing 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 Q3471881)