Resumen de Local optimalty in quasioncave bilevel programming
Herminia I. Calvete, Carlos Galé Bornao
Bilevel programming involves two optimization problems where the constraint region of the first level problem is implicitly determined by another optimization problem. In order to assure that they are well posed, when analyzing bilevel problems it is usually assumed that, for each value of the first level variables there will be a unique solution to the second level problem. This paper is concerned with the behavior of local optimal solutions to the Quasiconcave Bilevel Programming (QCBP) problem when the previous assumption is dropped. Necessary and sufficient conditions for a local solution to the second level problem to be isolated are established in order to guarantee that a local solution to the QCBP problem is found which is an extreme point of the polyhedron defined by the common constraints.
