A computational analysis of LCP methods for bilinear and concave quadratic programming

DOI10.1016/0305-0548(91)90002-9zbMath0741.90050OpenAlexW2057012359MaRDI QIDQ1184453

Joaquim Joao Júdice, Ana M. Faustino

Publication date: 28 June 1992

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(91)90002-9

zbMATH Keywords

branch-and-boundbilinear programmingconcave quadratic programsequential linear complementarity

Mathematics Subject Classification ID

Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (12)

On the solution and complexity of a generalized linear complementarity problem ⋮ A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints ⋮ Algorithms for linear programming with linear complementarity constraints ⋮ Optimal cycle for a signalized intersection using global optimization and complementarity ⋮ Accelerating convergence of cutting plane algorithms for disjoint bilinear programming ⋮ A computational analysis of LCP methods for bilinear and concave quadratic programming ⋮ A global supply chain model with transfer pricing and transportation cost allocation ⋮ On the solution of NP-hard linear complementarity problems ⋮ Generation of disjointly constrained bilinear programming test problems ⋮ A modified simplex approach for solving bilevel linear programming problems ⋮ On a Markov Decision Process problem involving the Maximum of the Difference between two functions: Technical Note ⋮ A new technique for generating quadratic programming test problems

Cites Work

• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
• Constrained global optimization: algorithms and applications
• A note on the solution of bilinear programming problems by reduction to concave minimization
• An experimental investigation of enumerative methods for the linear complementarity problem
• A parallel algorithm for constrained concave quadratic global minimization
• A computational analysis of LCP methods for bilinear and concave quadratic programming
• Links between linear bilevel and mixed 0-1 programming problems
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
• A New and Efficient Algorithm for a Class of Portfolio Selection Problems
• A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
• A cutting plane algorithm for solving bilinear programs
• Maximization of A convex quadratic function under linear constraints
• Bilinear programming: An exact algorithm
• A cutting plane algorithm for the bilinear programming problem
• Note on a Fundamental Theorem in Quadratic Programming

This page was built for publication: A computational analysis of LCP methods for bilinear and concave quadratic programming