mathematical program with complementarity constraints

The Standard Pessimistic Bilevel Problem

Pessimistic bilevel optimization problems, as optimistic ones, possess a structure
involving three interrelated optimization problems. Moreover, their finite infima are only attained
under strong conditions. We address these difficulties within a framework of moderate assumptions
and a perturbation approach which allow us to approximate such finite infima arbitrarily well by
minimal values of a sequence of solvable single-level problems. To this end, as already done for

© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma