Generating quadratic bilevel programming test problems
From MaRDI portal
Publication:4371565
DOI10.1145/174603.174411zbMath0888.65068OpenAlexW2020430967WikidataQ58040697 ScholiaQ58040697MaRDI QIDQ4371565
Paul H. Calamai, Luis Nunes 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
Related Items
On global search in nonconvex optimal control problems, A local convergence analysis of bilevel decomposition algorithms, Bilevel and multilevel programming: A bibliography review, A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints, An interior point technique for solving bilevel programming problems, Solving quadratic convex bilevel programming problems using a smoothing method, 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, Global solution of bilevel programs with a nonconvex inner program, Test problem construction for linear bilevel programming problems, 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, A new technique for generating quadratic programming test problems
