Is Pessimistic Bilevel Programming a Special Case of a Mathematical Program with Complementarity Constraints?
- 39 Downloads
One of the most commonly used methods for solving bilevel programming problems (whose lower level problem is convex) starts with reformulating it as a mathematical program with complementarity constraints. This is done by replacing the lower level problem by its Karush–Kuhn–Tucker optimality conditions. The obtained mathematical program with complementarity constraints is (locally) solved, but the question of whether a solution of the reformulation yields a solution of the initial bilevel problem naturally arises. The question was first formulated and answered negatively, in a recent work of Dempe and Dutta, for the so-called optimistic approach. We study this question for the pessimistic approach also in the case of a convex lower level problem with a similar answer. Some new notions of local solutions are defined for these minimax-type problems, for which the relations are shown. Some simple counterexamples are given.
KeywordsBilevel problem Mathematical programming with complementarity constraints Pessimistic approach
Mathematics Subject Classification90C30 90C33 90C47
This research benefited from the support of the “FMJH Program Gaspard Monge in optimization and operation research”, and from the support to this program from EDF.
- 8.Dassanayaka, S.M.: Methods of variational analysis in pessimistic bilevel programming. PhD thesis, Wayne State University (2010)Google Scholar
- 10.Zheng, Y., Fan, Y., Zhuo, X., Chen, J.: Pessimistic referential-uncooperative linear bilevel multi-follower decision making with an application to water resources optimal allocation (2016, unpublished)Google Scholar