On Reducibility in Bilevel Problems

DOI10.1137/080718231MaRDI QIDQ3563902zbMATH OpenOpenAlexFDO

Authors Stephan Dempe, Harald Günzel, Hubertus T. Jongen

Publication date 1 June 2010

Published in SIAM Journal on Optimization (Search for Journal in Brave)

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

zbMATH Keywords

bilevel optimizationgenericityhierarchical gamesoptimality conditionreducibility

Mathematics Subject Classification ID

Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Optimality conditions and duality in mathematical programming (90C46) Hierarchical games (including Stackelberg games) (91A65)

Recommendations

• scientific article; zbMATH DE number 6004927
• scientific article; zbMATH DE number 1163110
• scientific article; zbMATH DE number 1559437
• scientific article; zbMATH DE number 3858462
• On binary reducibility
• Reduction of indefinite quadratic programs to bilinear programs
• Some properties of the bilevel programming problem
• scientific article; zbMATH DE number 2242722
• Bilevel programs: approximation results involving reverse convex programs
• A note on the solution of bilinear programming problems by reduction to concave minimization

Cited in

(5)

• On generalized semi-infinite optimization and bilevel optimization
• Bilevel optimization: on the structure of the feasible set
• On intrinsic complexity of Nash equilibrium problems and bilevel optimization
• Bilevel optimization: theory, algorithms, applications and a bibliography
• Generic property of the partial calmness condition for bilevel programming problems

This page was built for publication: On Reducibility in Bilevel Problems

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