Document Type

Technical Report

Abstract

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.

Number in Series

2007.03

Disciplines

Applied Mathematics | Mathematics

Comments

This research was partly supported by the US National Science Foundation under grants DMS-0304989 and DMS-0603846 and by the Australian Research Council under grant DP-0451168

Share

COinS