Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Dempe, S.: Foundations of Bilevel Programming. Springer, Berlin (2002)
Dempe, S., Dutta, J.: Is bilevel programming a special case of a mathematical program with complementarity constraints? Math. Program. 131, 37–48 (2012)
Dempe, S., Mordukhovich, B.S., Zemkoho, A.B.: Sensitivity analysis for two-level value functions with applications to bilevel programming. SIAM J. Optim. 22, 1309–1343 (2012)
Ye, J.J., Zhu, D.: New necessary optimality conditions for bilevel programs by combining the MPEC and value function approaches. SIAM J. Optim. 20, 1885–1905 (2010)
Lignola, M.B., Morgan, J.: Topological existence and stability for Stackelberg problems. J. Optim. Theory Appl. 84(1), 145–169 (1995)
Loridan, P., Morgan, J.: Weak via strong Stackelberg problem: new results. J. Glob. Optim. 8, 263–287 (1996)
Dempe, S., Mordukhovich, B.S., Zemkoho, A.B.: Necessary optimality conditions in pessimistic bilevel programming. Optimization 63, 505–533 (2014)
Dassanayaka, S.M.: Methods of variational analysis in pessimistic bilevel programming. PhD thesis, Wayne State University (2010)
Zheng, Y., Fang, D., Wan, Z.: A solution approach to the weak linear bilevel programming problems. Optimization 65, 1437–1449 (2016)
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)
Hiriart-Urruty, J.-B., Lemaréchal, C.: Convex Analysis and Minimization Algorithms I: Fundamentals, vol. 305. Springer, Berlin (2013)
Robinson, S.M.: Generalized Equations and Their Solutions, Part II: Applications to Nonlinear Programming. Springer, Berlin (1982)
Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming: Theory and Algorithms. Wiley, Hoboken (2013)
Acknowledgements
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.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by René Henrion.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Aussel, D., Svensson, A. Is Pessimistic Bilevel Programming a Special Case of a Mathematical Program with Complementarity Constraints?. J Optim Theory Appl 181, 504–520 (2019). https://doi.org/10.1007/s10957-018-01467-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-018-01467-7