scientific article; zbMATH DE number 4189490

MaRDI QIDQ5753757zbMATH OpenFDO

Authors Faiz Al-Khayyal

Publication date 1990

zbMATH Keywords

supporting hyperplanelinear complementarityBilinear programming

Mathematics Subject Classification ID

Linear programming (90C05) 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
• Linear complementarity problems solvable by integer programming
• A computational analysis of LCP methods for bilinear and concave quadratic programming
• Enumeration approach for linear complementarity problems based on a reformulation-linearization technique

Cited in

(11)

• Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP
• On characterizing linear complementarity problems as linear programs
• Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
• A computational analysis of LCP methods for bilinear and concave quadratic programming
• Unified approaches for solvable and unsolvable linear complementarity problems
• Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
• Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
• On the solution of NP-hard linear complementarity problems
• Enhanced intersection cutting-plane approach for linear complementarity problems
• On the complexity of linear programming in the BSS-model
• Lower-dimensional linear complementarity problem approaches to the solution of a bi-obstacle problem

This page was built for publication:

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