The Generalized Mangasarian‐Fromowitz Constraint Qualification and Optimality Conditions for Bilevel Programs

We consider the optimal value reformulation of the bilevel programming problem. It is shown that the Mangasarian‐Fromowitz constraint qualification in terms of the basic generalized differentiation constructions of Mordukhovich, which is weaker than the one in terms of Clarke's nonsmooth tools, fails without any restrictive assumption. Some weakened forms of this constraint qualification are then suggested, in order to derive Karush‐Kuhn‐Tucker type optimality conditions for the aforementioned problem. Considering the partial calmness, a new characterization is suggested and the link with the previous constraint qualifications is analyzed.