The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- 5 January 2012
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 138 (1-2) , 447-473
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- On the Karush–Kuhn–Tucker reformulation of the bilevel optimization problemNonlinear Analysis, 2012
- Bilevel road pricing: theoretical analysis and optimality conditionsAnnals of Operations Research, 2011
- On calmness conditions in convex bilevel programmingApplicable Analysis, 2011
- The Generalized Mangasarian-Fromowitz Constraint Qualification and Optimality Conditions for Bilevel ProgramsJournal of Optimization Theory and Applications, 2010
- Is bilevel programming a special case of a mathematical program with complementarity constraints?Mathematical Programming, 2010
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programsMathematical Programming, 2009
- Variational Analysis in Bilevel Programming2008
- New necessary optimality conditions in optimistic bilevel programmingOptimization, 2007
- Congested O-D Trip Demand Adjustment Problem: Bilevel Programming Formulation and Optimality Conditions1998
- On combining maximum entropy trip matrix estimation with user optimal assignmentTransportation Research Part B: Methodological, 1988