Fatima ezzahra Saissi – Mathematics and Decision

$\begin{quote} \begin{center} \textbf{Optimality conditions for bilevel optimization problems with extremal value function} \end{center} \medskip We provide necessary and sufficient optimality conditions for the bilevel programming problem with extremal value function. Our approach is based on the use of Fenchel lagrange duality. This latter is applied after a decomposition of the problem into a family of convex subproblems. The optimality conditions are expressed in terms of subdifferentials and normal cones in the sense of convex analysis and the obtained results are new in the literature of bilevel programming. \end{quote}$