Generation of disjointly constrained bilinear programming test problems

DOI10.1007/BF00249639zbMath0786.90052OpenAlexW2068167162WikidataQ58040711 ScholiaQ58040711MaRDI QIDQ1803651

Paul H. Calamai, Luis Nunes Vicente, Joaquim Joao Júdice

Publication date: 29 June 1993

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00249639

zbMATH Keywords

separable bilinear programming

Mathematics Subject Classification ID

Quadratic programming (90C20)

Related Items

On global search in nonconvex optimal control problems, A mixed-integer linear programming reduction of disjoint bilinear programs via symbolic variable elimination, Multi-period price promotions in a single-supplier, multi-retailer supply chain under asymmetric demand information, Constructing test functions for global optimization using continuous formulations of graph problems, A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience

Cites Work

• A computational analysis of LCP methods for bilinear and concave quadratic programming
• Efficient algorithms for solving rank two and rank three bilinear programming problems
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
• The bilinear programming problem
• 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