Variational Analysis in Bilevel Programming

The paper is devoted to applications of advanced tools of modern variational analysis and generalized differentiation to problems of optimistic bilevel programming. In this way, new necessary optimality conditions are derived for two major classes of bilevel programs: those with partially convex and with fully convex lower-level problems. We provide detailed discussions of the results obtained and their relationships with known results in this area.