Note on solving linear complementarity problems as jointly constrained bilinear programs

DOI10.1016/0022-247X(91)90259-3zbMath0732.90083MaRDI QIDQ809900

Faiz A. Al-Khayyal

Publication date: 1991

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

zbMATH Keywords

linear complementarityconstrained bilinear programs

Mathematics Subject Classification ID

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

Related Items (1)

Finite convergence of algorithms for nonlinear programs and variational inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• Finite convergence of algorithms for nonlinear programs and variational inequalities
• Jointly constrained bilinear programs and related problems: An overview
• Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
• Bounds for the solution set of linear complementarity problems
• Optimization with disjunctive constraints
• Solving the linear complementarity problem through concave programming
• Jointly Constrained Biconvex Programming
• A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
• An implicit enumeration procedure for the general linear complementarity problem
• Global Optimization Approach to the Linear Complementarity Problem

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