Linear, quadratic, and bilinear programming approaches to the linear complementarity problem

DOI10.1016/0377-2217(86)90043-3zbMath0581.90091OpenAlexW1973869322MaRDI QIDQ1068731

Faiz A. Al-Khayyal

Publication date: 1986

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(86)90043-3

zbMATH Keywords

global optimizationlinear complementaritynonconvex programmingbranch and boundbilinear programmingbiconvex programmingimplicit enumeration

Mathematics Subject Classification ID

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

Related Items (11)

A weighting method for 0-1 indefinite quadratic bilevel programming ⋮ Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods ⋮ An experimental investigation of enumerative methods for the linear complementarity problem ⋮ On characterizing linear complementarity problems as linear programs ⋮ Jointly constrained bilinear programs and related problems: An overview ⋮ Fuzzy goal programming technique for multi-objective indefinite quadratic bilevel programming problem ⋮ Lagrangean duality for facial programs with applications to integer and complementarity problems ⋮ On the indefinite quadratic bilevel programming problem. ⋮ A new reformulation-linearization technique for bilinear programming problems ⋮ Linear multiplicative programming ⋮ Note on solving linear complementarity problems as jointly constrained bilinear programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Jointly constrained bilinear programs and related problems: An overview
• On the gradient-projection method for solving the nonsymmetric linear complementarity problem
• Plastic-elastic torsion, optimal stopping and free boundaries
• A note on the complementarity problem
• Complementary pivot theory of mathematical programming
• On the number of solutions to the complementarity problem and spanning properties of complementary cones
• A complementarity approach for solving Leontief substitution systems and (generalized) Markov decision processes
• On characterizing linear complementarity problems as linear programs
• Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's
• Jointly Constrained Biconvex Programming
• A finite descent theory for linear programming, piecewise linear convex minimization, and the linear complementarity problem
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
• A variable dimension algorithm for the linear complementarity problem
• Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Programs
• A cutting plane algorithm for solving bilinear programs
• Linear complementarity problems solvable by A single linear program
• Bilinear programming: An exact algorithm
• A note on an open problem in linear complementarity
• A cutting plane algorithm for the bilinear programming problem
• Characterization of linear complementarity problems as linear programs
• On solving linear complementarity problems as linear programs
• Computational complexity of complementary pivot methods
• A linear max—min problem
• Error bounds for monotone linear complementarity problems
• Application of disjunctive programming to the linear complementarity problem
• Equilibrium Points of Bimatrix Games
• Bimatrix Equilibrium Points and Mathematical Programming

This page was built for publication: Linear, quadratic, and bilinear programming approaches to the linear complementarity problem