Generating quadratic bilevel programming test problems

DOI10.1145/174603.174411MaRDI QIDQ4371565zbMATH OpenOpenAlexWikidataFDO

Authors Paul H. Calamai, L. N. Vicente

Publication date 25 January 1998

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10316/10700, http://www.acm.org/pubs/contents/journals/toms/1994-20/

zbMATH Keywords

global and local solutionsquadratic bilevel programmingtest problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Recommendations

• Generating Linear and Linear-Quadratic Bilevel Programming Problems
• A new technique for generating quadratic programming test problems
• Test problem construction for linear bilevel programming problems
• Test problem generation for quadratic-linear pessimistic bilevel optimization

Cited in

(20)

• Global solution of bilevel programs with a nonconvex inner program
• A new technique for generating quadratic programming test problems
• Bilevel and multilevel programming: A bibliography review
• Test problem construction for linear bilevel programming problems
• On computational search for optimistic solutions in bilevel problems
• Complementarity active-set algorithm for mathematical programming problems with equilibrium constraints
• A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
• On global search in nonconvex optimal control problems
• Test problem generation for quadratic-linear pessimistic bilevel optimization
• An interior point technique for solving bilevel programming problems
• Algorithm 728: FORTRAN subroutines for generating quadratic bilevel programming test problems
• Construction of test problems in quadratic bivalent programming
• Global search for bilevel optimization with quadratic data
• A unified framework for multistage mixed integer linear optimization
• BOLIB: bilevel Optimization LIBrary of test problems
• Bilevel optimization: theory, algorithms, applications and a bibliography
• Solving quadratic convex bilevel programming problems using a smoothing method
• One way to solve pessimistic bilevel optimization problems
• A local convergence analysis of bilevel decomposition algorithms
• A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints

This page was built for publication: Generating quadratic bilevel programming test problems

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