Abstract
An algorithm is presented for solving bilevel optimization problems with fully convex lower level problems. Convergence to a local optimal solution is shown under certain weak assumptions. This algorithm uses the optimal value transformation of the problem. Transformation of the bilevel optimization problem using the Fritz-John necessary optimality conditions applied to the lower level problem is shown to exhibit almost the same difficulties for solving the problem as the use of the Karush–Kuhn–Tucker conditions.
Similar content being viewed by others
References
Bard, J.F.: Practical Bilevel Optimization: Algorithms and applications. Kluwer Academic Publishers, Dordrecht (1998)
Dempe, S.: Foundations of Bilevel Programming. Kluwer Academic Publishers, Dordrecht (2002)
Dempe, S., Kalashnikov, V., Pérez-Valdés, G.A., Kalashnykova, N.: Bilevel Programming Problems—Theory, Algorithms and Applications to Energy Networks. Springer Verlag, Heidelberg (2015)
Dempe, S.: Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints. Optimization 52, 333–359 (2003)
Burgard, A.P., Pharkya, P., Maranas, C.D.: Optknock: a bilevel programming framework for identifying gene knockout strategies for microbial strain optimization. Biotechnol. Bioeng. 84(6), 647–657 (2003)
Hibino, G., Kainuma, M., Matsuoka, Y.: Two-level mathematical programming for analyzing subsidy options to reduce greenhouse-gas emissions. Tech. Report WP-96-129, IIASA, Laxenburg, Austria (1996)
González, V.J.L., Camacho Vallejo, J.F., Pinto Serrano, G.: A scatter search algorithm for solving a bilevel optimization model for determining highway tolls. Comput. Syst. 19, 3529–3549 (2015)
Sadatrasou, S.M., Gholamian, M.R., Shahanaghi, K.: An application of data mining classification and bi-level programming for optimal credit allocation. Decis. Sci. Lett. 4, 35–50 (2015)
Aksen, D., Akca, S.S., Aras, N.: A bilevel partial interdiction problem with capacitated facilities and demand outsourcing. Comput. Oper. Res. 41, 346–358 (2014)
Deng, X.: Complexity issues in bilevel linear programming. In: Migdalas, A., Pardalos, P.M., Värbrand, P. (eds.) Multilevel Optimization: Algorithms and Applications, pp. 149–164. Kluwer Academic Publishers, Dordrecht (1998)
Dempe, S., Dutta, J., Mordukhovich, B.S.: New necessary optimality conditions in optimistic bilevel programming. Optimization 56, 577–604 (2007)
Günzel, H., Jongen, HTh, Stein, O.: Generalized semi-infinite programming: the symmetric reduction ansatz. Optim. Lett. 2(3), 415–424 (2008)
Stein, O.: Bi-level strategies in semi-infinite programming. Kluwer Akademic Publishers, Boston (2003)
Stein, O., Still, G.: On generalized semi-infinite optimization and bilevel optimization. Eur. J. Oper. Res. 142(3), 444–462 (2002)
Weber, G.-W.: Generalized Semi-infinite Optimization and Related Topics. Heldermann Verlag, Lemgo (2003)
Outrata, J., Kočvara, M., Zowe, J.: Nonsmooth Approach to Optimization Problems with Equilibrium Constraints. Kluwer Academic Publishers, Dordrecht (1998)
Dempe, S., Pilecka, M.: Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming. J. Glob. Optim. 61(4), 769–788 (2015)
Audet, C., Hansen, P., Jaumard, B., Savard, G.: Links between linear bilevel and mixed 0–1 programming problems. J. Optim. Theory Appl. 93, 273–300 (1997)
Jeyakumar, V., Lasserrey, J.B., Liz, G., Pham, T.S.: Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems. Tech. report, Department of Applied Mathematics, University of New South Wales, Sydney, Australia (2015). arXiv:1506.02099v1
Ye, J.J., Zhu, D.L.: Optimality conditions for bilevel programming problems. Optimization 33, 9–27 (1995)
Henrion, R., Surowiec, T.: On calmness conditions in convex bilevel programming. Appl. Anal. 90(5–6), 951–970 (2011)
Mirrlees, J.A.: The theory of moral hazard and unobservable behaviour: part I. Rev. Econ. Stud. 66, 3–21 (1999)
Scheel, H., Scholtes, S.: Mathematical programs with equilibrium constraints: stationarity, optimality, and sensitivity. Math. Oper. Res. 25, 1–22 (2000)
Hoheisel, T., Kanzow, C., Schwartz, A.: Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints. Math. Progr. 137(1–2), 257–288 (2013)
Dempe, S., Dutta, J.: Is bilevel programming a special case of a mathematical program with complementarity constraints? Math. Progr. 131, 37–48 (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(4), 1885–1905 (2010)
Allende, G.B., Still, G.: Solving bilevel programs with the KKT-approach. Math. Progr. 138, 309–332 (2013)
Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation, Basic Theory. Springer, Berlin (2006)
Ulbrich, M., Ulbrich, S.: Nichtlineare Optimierung. Birkhäuser, Basel (2012)
Bank, B., Guddat, J., Klatte, D., Kummer, B., Tammer, K.: Non-linear Parametric Optimization. Birkhäuser Verlag, Basel (1983)
Mitsos, A., Lemonidis, P., Barton, P.I.: Global solution of bilevel programs with a nonconvex inner program. J. Glob. Optim. 42(4), 475–513 (2008)
Kleniati, P.-M., Adjiman, C.S.: Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: convergence analysis and numerical results. J. Glob. Optim. 60(3), 459–481 (2014)
Dempe, S., Franke, S.: Solution algorithm for an optimistic linear Stackelberg problem. Comput. Oper. Res. 41, 277–281 (2014)
Zeng, B., An, Y.: Solving bilevel mixed integer program by reformulations and decomposition. Tech. report, Dept. of Industrial and Management Systems Engineering, University of South Florida (2014)
Strekalovsky, A.S.: On local search in D.C. optimization problems. Appl. Math. Comput. 255, 73–83 (2015)
Tuy, H., Gannadan, S.: A new branch and bound method for bilevel linear programs. In: Migdalas, A., Pardalos, P.M., Värbrand, P. (eds.) Multilevel Optimization: Algorithms and Applications, pp. 231–249. Kluwer Academic Publishers, Dordrecht (1998)
Beer, K.: Lösung großer Linearer Optimierungsaufgaben. Deutscher Verlag der Wissenschaften, Berlin (1977)
Dempe, S., Franke, S.: The bilevel road pricing problem. Int. J. Comput. Optim. 2(2), 71–92 (2015)
Dhara, A., Dutta, J.: Optimality Conditions in Convex Optimization: A finite-Dimensional View. CRC Press, Boca Raton (2012)
Klatte, D., Kummer, B.: Stability properties of infima and optimal solutions of parametric optimization problems, Nondifferentiable Optimization: Motivations and Applications. In: Proceedings of the IIASA workshop, Sopron, 1984 (V.F. Demyanov, ed.), Lecture Notes in Economics and Mathematical Systems, vol. 255, pp. 215–229. Springer, Berlin (1984)
Hiriart-Urruty, J.-B., Lemaréchal, C.: Fundam. Convex Anal. Springer, Berlin (2001)
Author information
Authors and Affiliations
Corresponding author
Additional information
The author’s work has been supported by Deutsche Forschungsgemeinschaft.
Rights and permissions
About this article
Cite this article
Dempe, S., Franke, S. On the solution of convex bilevel optimization problems. Comput Optim Appl 63, 685–703 (2016). https://doi.org/10.1007/s10589-015-9795-8
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-015-9795-8
Keywords
- Bilevel programming
- Mathematical programs with equilibrium constraints
- Optimal value transformation
- KKT-transformation
- Solution algorithm