First-order necessary optimality conditions for general bilevel programming problems
From MaRDI portal
Publication:5921628
DOI10.1007/BF02192648zbMath0866.90119MaRDI QIDQ5921628
Publication date: 4 August 1997
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Lagrange multipliers; nonsmooth analysis; value functions; necessary conditions of optimality; general bilevel programming
Related Items
First-order necessary optimality conditions for general bilevel programming problems, Optimality conditions for optimistic bilevel programming problem using convexifactors, Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development, Optimality and duality results for bilevel programming problem using convexifactors, Deriving the properties of linear bilevel programming via a penalty function approach, A novel approach to bilevel nonlinear programming, An overview of bilevel optimization
Cites Work