Global Solution of Bilevel Programming Problems

DOI10.1007/978-3-319-28697-6_80zbMath1346.90691OpenAlexW2408827998MaRDI QIDQ2807010

Sonja Steffensen

Publication date: 19 May 2016

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-28697-6_80

zbMATH Keywords

additional constraintsMINLP refomulation

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (1)

Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• An algorithmic framework for convex mixed integer nonlinear programs
• Review of nonlinear mixed-integer and disjunctive programming techniques
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• An overview of bilevel optimization
• Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
• Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
• An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs)
• Mixed-integer nonlinear optimization
• A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
• Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints

This page was built for publication: Global Solution of Bilevel Programming Problems