Abstract
We discuss the global solution of Bilevel Programming Problems using their reformulations as Mathematical Programs with Complementarity Constraints and/or Mixed Integer Nonlinear Programs. We show that under suitable assumptions the Bilevel Program can be reformulated and globally solved via MINLP refomulation. We also briefly discuss some simplifications and suitable additional constraints.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Bard, J.F.: Practical Bilevel Optimization: Algorithms and Applications. Kluwer Academic Publishers, Dordrecht (1998)
Belotti, P., Kirches, Ch., Leyffer, S., Linderoth, J., Luedtke, J., Mahajan, A.: Mixed-Integer nonlinear optimization. Acta Numerica 22, 1–131 (2013)
Bonami, P., Biegler, L.T., Conn, A.R., Cornujols, G., Grossmann, I.E., Laird, C.D., Lee, J., Lodi, A., Margot, F., Sawaya, N., Wchter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discret. Optim. 5(2), 186–204 (2008)
Bracken, J., McGill, J.: Mathematical programs with optimization problems in the constraints. Oper. Res. 21, 3744 (1973)
Bracken, J., McGill, J.: Defense applications of mathematical programs with optimization problems in the constraints. Oper. Res. 22, 1086–1096 (1974)
Colson, B., Marcotte, P., Savard, G.: An overview of bilevel optimization. Ann. Oper. Res. 153, 235–256 (2007)
Ct, J.-P., Marcotte, P., Savard, G.: A bilevel modeling approach to pricing and fare optimization in the airline industry. J. Revenue Pricing Manage. 2, 23–36 (2003). Dempe, S.: A necessary and a sufficient optimality condition for bilevel programming (1992a)
Dempe, S.: Foundations of Bilevel Programming. Kluwer Academic Publishers, Dordrecht (2002)
Dempe, S., Dutta, J.: Is Bilevel programming a special case of mathematical programs with complementarity constraints?. Math. Program. Series A, 131, 37–48 (2012)
de Miguel, A.V., Friedlander, M.P., Nogales, F.J., Scholtes, S.: A two-sided relaxation scheme for mathematical programs with equilibrium constraints. SIAM J. Optim. 16, 587–609 (2005)
Fletcher, R., Leyffer, S., Ralph, D., Scholtes, S.: Local convergence of SQP-methods for mathematical programs with equilibrium constraints. SIAM J. Optim. 17(1), 259–286 (2006)
Garcia, R., Marin, A.: Parking Capacity and pricing in parkn ride trips: a continuous equilibrium network design problem. Ann. Oper. Res. 116, 153–178 (2002)
Grossmann, I.E.: Review of nonlinear mixed-integer and disjunctive programming techniques. Optim. Eng. 3, 227–252 (2002)
Hu, X.M., Ralph, D.: Convergence of a penalty method for mathematical programming with complementarity constraints. J. Optim. Theory Appl. 123(2), 365–390 (2004)
Mitsos, A., Lemonidis, P., Barton, P.I.: Globla solution of bilevel programs with a nonconvex inner program. J. Optim. Theory Appl. 123(2), 365–390 (2004)
Raghunathan, A.U., Biegler, L.T.: Interior point methods for Mathematical Programs with Complementarity Constraints (MPCCs). SIAM J. Optim. 15(3), 720–750 (2005)
Scheel, H., Scholtes, S.: Mathematical programs with complementarity constraints: stationarity. Optim. Sensit. Math. Oper. Res. 25, 1–22 (2000)
Scholtes, S.: Convergence properties of a regularization scheme for mathematical programs with complementarity constraints. SIAM J. Optim. 11(4), 918–936 (2001)
Steffensen, S., Ulbrich, M.: A new relaxation scheme for mathematical programs with equilibrium constraints. SIAM J. Optim. (2010)
Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math. Program. 99(3), 563–591 (2004)
Ye, J.J.: Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints. J. Math. Anal. Appl. 307, 350–369 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Steffensen, S. (2016). Global Solution of Bilevel Programming Problems. In: Lübbecke, M., Koster, A., Letmathe, P., Madlener, R., Peis, B., Walther, G. (eds) Operations Research Proceedings 2014. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-28697-6_80
Download citation
DOI: https://doi.org/10.1007/978-3-319-28697-6_80
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-28695-2
Online ISBN: 978-3-319-28697-6
eBook Packages: Business and ManagementBusiness and Management (R0)