Bilevel problems over polyhedra with extreme point optimal solutions
From MaRDI portal
Publication:453637
DOI10.1007/s10898-011-9762-6zbMath1251.90363MaRDI QIDQ453637
Sebastian Lohse, Carmen Galé, Herminia I. Calvete, Stephan Dempe
Publication date: 27 September 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9762-6
90C30: Nonlinear programming
Related Items
Global Search for Bilevel Optimization with Quadratic Data, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, A decision tool based on bilevel optimization for the allocation of water resources in a hierarchical system, Linear bilevel programming with interval coefficients, Bi-level programming problem in the supply chain and its solution algorithm, An evolutionary algorithm for solving bilevel programming problems using duality conditions, Optimality conditions for nonsmooth multiobjective bilevel optimization problems, A Cutting Plane Approach for Solving Linear Bilevel Programming Problems
Cites Work
- Unnamed Item
- Linear bilevel programming with upper level constraints depending on the lower level solution
- A note on the definition of a linear bilevel programming solution
- On the quasiconcave bilevel programming problem
- Practical bilevel optimization. Algorithms and applications
- Bilevel and multilevel programming: A bibliography review
- Multilevel optimization: algorithms and applications
- Foundations of bilevel programming
- Deriving the properties of linear bilevel programming via a penalty function approach
- Linear bilevel multi-follower programming with independent followers
- On the continuity of the minimum set of a continuous function
- Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- The Direct Power of Adjacent Vertex Programming Methods
- Convex Analysis
