Generation of disjointly constrained bilinear programming test problems

DOI10.1007/BF00249639MaRDI QIDQ1803651zbMATH OpenOpenAlexWikidataFDO

Authors Paul H. Calamai, L. N. Vicente, Joaquim J. 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)

Review text

The purpose of this paper is to propose a technique for constructing standard bilinear programming test problems with known solutions and properties. The proposed construction technique applies a simple random transformation of variables to a separable bilinear programming problem that is constructed by combining disjoint low-dimensional bilinear programs.

Recommendations

• Generating Linear and Linear-Quadratic Bilevel Programming Problems
• A new technique for generating quadratic programming test problems
• Construction of test problems for concave minimization under linear and nonlinear constraints
• Test problem construction for linear bilevel programming problems
• Numerical solution of bilinear programming problems

Cites work

• A computational analysis of LCP methods for bilinear and concave quadratic programming
• A cutting plane algorithm for solving bilinear programs
• A cutting plane algorithm for the bilinear programming problem
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
• Bilinear programming: An exact algorithm
• Efficient algorithms for solving rank two and rank three bilinear programming problems
• Maximization of A convex quadratic function under linear constraints
• The bilinear programming problem

Cited in

(9)

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

This page was built for publication: Generation of disjointly constrained bilinear programming test problems

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