Note on solving linear complementarity problems as jointly constrained bilinear programs

DOI10.1016/0022-247X(91)90259-3MaRDI QIDQ809900zbMATH OpenFDO

Authors Faiz Al-Khayyal

Publication date 1991

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-247X(91)90259-3

zbMATH Keywords

constrained bilinear programslinear complementarity

Mathematics Subject Classification ID

Linear programming (90C05) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
• The linear complementarity problem as a separable bilinear program
• On characterizing linear complementarity problems as linear programs
• Publication:5753757
• scientific article; zbMATH DE number 653034

Cites work

• A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
• An implicit enumeration procedure for the general linear complementarity problem
• Bounds for the solution set of linear complementarity problems
• Finite convergence of algorithms for nonlinear programs and variational inequalities
• Global Optimization Approach to the Linear Complementarity Problem
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 3356467 (Why is no real title available?)
• Jointly Constrained Biconvex Programming
• Jointly constrained bilinear programs and related problems: An overview
• Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
• Optimization with disjunctive constraints
• Solving the linear complementarity problem through concave programming

Cited in

(5)

• Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
• Efficient methods for solving certain bilinear programming problems
• The linear complementarity problem as a separable bilinear program
• scientific article; zbMATH DE number 4185418 (Why is no real title available?)
• Finite convergence of algorithms for nonlinear programs and variational inequalities

This page was built for publication: Note on solving linear complementarity problems as jointly constrained bilinear programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809900)