zbMATH — the first resource for mathematics

On the solution of convex bilevel optimization problems. (English) Zbl 1343.90065
Summary: 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.

90C26 Nonconvex programming, global optimization
91A65 Hierarchical games (including Stackelberg games)
Full Text: DOI
[1] Bard, J.F.: Practical Bilevel Optimization: Algorithms and applications. Kluwer Academic Publishers, Dordrecht (1998) · Zbl 0943.90078
[2] Dempe, S.: Foundations of Bilevel Programming. Kluwer Academic Publishers, Dordrecht (2002) · Zbl 1038.90097
[3] 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) · Zbl 1338.90005
[4] Dempe, S, Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints, Optimization, 52, 333-359, (2003) · Zbl 1140.90493
[5] Burgard, AP; Pharkya, P; Maranas, CD, Optknock: a bilevel programming framework for identifying gene knockout strategies for microbial strain optimization, Biotechnol. Bioeng., 84, 647-657, (2003)
[6] 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)
[7] González, VJL; Camacho Vallejo, JF; Pinto Serrano, G, A scatter search algorithm for solving a bilevel optimization model for determining highway tolls, Comput. Syst., 19, 3529-3549, (2015)
[8] Sadatrasou, SM; Gholamian, MR; Shahanaghi, K, An application of data mining classification and bi-level programming for optimal credit allocation, Decis. Sci. Lett., 4, 35-50, (2015)
[9] Aksen, D; Akca, SS; Aras, N, A bilevel partial interdiction problem with capacitated facilities and demand outsourcing, Comput. Oper. Res., 41, 346-358, (2014) · Zbl 1348.91080
[10] Deng, X; Migdalas, A (ed.); Pardalos, PM (ed.); Värbrand, P (ed.), Complexity issues in bilevel linear programming, 149-164, (1998), Dordrecht · Zbl 0902.90119
[11] Dempe, S; Dutta, J; Mordukhovich, BS, New necessary optimality conditions in optimistic bilevel programming, Optimization, 56, 577-604, (2007) · Zbl 1172.90481
[12] Günzel, H; Jongen, HTh; Stein, O, Generalized semi-infinite programming: the symmetric reduction ansatz, Optim. Lett., 2, 415-424, (2008) · Zbl 1152.90629
[13] Stein, O.: Bi-level strategies in semi-infinite programming. Kluwer Akademic Publishers, Boston (2003) · Zbl 1103.90094
[14] Stein, O; Still, G, On generalized semi-infinite optimization and bilevel optimization, Eur. J. Oper. Res., 142, 444-462, (2002) · Zbl 1081.90063
[15] Weber, G.-W.: Generalized Semi-infinite Optimization and Related Topics. Heldermann Verlag, Lemgo (2003) · Zbl 1056.90134
[16] Outrata, J., Kočvara, M., Zowe, J.: Nonsmooth Approach to Optimization Problems with Equilibrium Constraints. Kluwer Academic Publishers, Dordrecht (1998) · Zbl 0947.90093
[17] Dempe, S; Pilecka, M, Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming, J. Glob. Optim., 61, 769-788, (2015) · Zbl 1344.90055
[18] 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) · Zbl 0901.90153
[19] 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 · Zbl 1152.90629
[20] Ye, JJ; Zhu, DL, Optimality conditions for bilevel programming problems, Optimization, 33, 9-27, (1995) · Zbl 0820.65032
[21] Henrion, R; Surowiec, T, On calmness conditions in convex bilevel programming, Appl. Anal., 90, 951-970, (2011) · Zbl 1247.90250
[22] Mirrlees, JA, The theory of moral hazard and unobservable behaviour: part I, Rev. Econ. Stud., 66, 3-21, (1999) · Zbl 0958.91027
[23] Scheel, H; Scholtes, S, Mathematical programs with equilibrium constraints: stationarity, optimality, and sensitivity, Math. Oper. Res., 25, 1-22, (2000) · Zbl 1073.90557
[24] Hoheisel, T; Kanzow, C; Schwartz, A, Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints, Math. Progr., 137, 257-288, (2013) · Zbl 1262.65065
[25] Dempe, S; Dutta, J, Is bilevel programming a special case of a mathematical program with complementarity constraints?, Math. Progr., 131, 37-48, (2012) · Zbl 1235.90145
[26] Ye, JJ; Zhu, D, New necessary optimality conditions for bilevel programs by combining the MPEC and value function approaches, SIAM J. Optim., 20, 1885-1905, (2010) · Zbl 1279.90187
[27] Allende, GB; Still, G, Solving bilevel programs with the KKT-approach, Math. Progr., 138, 309-332, (2013) · Zbl 1280.90113
[28] Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation, Basic Theory. Springer, Berlin (2006)
[29] Ulbrich, M., Ulbrich, S.: Nichtlineare Optimierung. Birkhäuser, Basel (2012) · Zbl 1236.90002
[30] Bank, B., Guddat, J., Klatte, D., Kummer, B., Tammer, K.: Non-linear Parametric Optimization. Birkhäuser Verlag, Basel (1983) · Zbl 0502.49002
[31] Mitsos, A; Lemonidis, P; Barton, PI, Global solution of bilevel programs with a nonconvex inner program, J. Glob. Optim., 42, 475-513, (2008) · Zbl 1163.90700
[32] Kleniati, P-M; Adjiman, CS, Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. part II: convergence analysis and numerical results, J. Glob. Optim., 60, 459-481, (2014) · Zbl 1310.90092
[33] Dempe, S; Franke, S, Solution algorithm for an optimistic linear Stackelberg problem, Comput. Oper. Res., 41, 277-281, (2014) · Zbl 1348.91081
[34] 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)
[35] Strekalovsky, AS, On local search in D.C. optimization problems, Appl. Math. Comput., 255, 73-83, (2015) · Zbl 1338.90327
[36] Tuy, H; Gannadan, S; Migdalas, A (ed.); Pardalos, PM (ed.); Värbrand, P (ed.), A new branch and bound method for bilevel linear programs, 231-249, (1998), Dordrecht · Zbl 0897.90148
[37] Beer, K.: Lösung großer Linearer Optimierungsaufgaben. Deutscher Verlag der Wissenschaften, Berlin (1977) · Zbl 0354.90049
[38] Dempe, S; Franke, S, The bilevel road pricing problem, Int. J. Comput. Optim., 2, 71-92, (2015)
[39] Dhara, A., Dutta, J.: Optimality Conditions in Convex Optimization: A finite-Dimensional View. CRC Press, Boca Raton (2012) · Zbl 1251.90002
[40] 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) · Zbl 0958.91027
[41] Hiriart-Urruty, J.-B., Lemaréchal, C.: Fundam. Convex Anal. Springer, Berlin (2001)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.