Generating Linear and Linear-Quadratic Bilevel Programming Problems

DOI10.1137/0914049zbMath0802.65079OpenAlexW1969100915MaRDI QIDQ3140139

Paul H. Calamai, Luis Nunes Vicente

Publication date: 20 December 1993

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0914049

zbMATH Keywords

bilevel programminggeneration of test problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Linear programming (90C05)

Related Items

Bilevel and multilevel programming: A bibliography review, A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints, Approximated set-valued mapping approach for handling multiobjective bilevel problems, On computational search for optimistic solutions in bilevel problems, Complementarity active-set algorithm for mathematical programming problems with equilibrium constraints, Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms, A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience, A study of local solutions in linear bilevel programming, 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, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, A simplex approach for finding local solutions of a linear bilevel program by equilibrium points