Bilevel programming with convex lower level problems

DOI10.1007/0-387-34221-4_3zbMath1133.90015OpenAlexW1941184436MaRDI QIDQ3436937

Joydeep Dutta, Stephan Dempe

Publication date: 11 May 2007

Published in: Optimization with Multivalued Mappings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/0-387-34221-4_3

zbMATH Keywords

necessary optimality conditionsbilevel programming

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53)

Related Items (11)

Feasible direction method for bilevel programming problem ⋮ Solving ill-posed bilevel programs ⋮ Optimality Conditions for Bilevel Programming: An Approach Through Variational Analysis ⋮ Variational analysis of marginal functions with applications to bilevel programming ⋮ The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs ⋮ A primal nonsmooth reformulation for bilevel optimization problems ⋮ Optimality Conditions for a Simple Convex Bilevel Programming Problem ⋮ New necessary optimality conditions in optimistic bilevel programming ⋮ Quadratic Support Functions in Quadratic Bilevel Problems ⋮ Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

This page was built for publication: Bilevel programming with convex lower level problems