{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T04:16:24Z","timestamp":1778645784130,"version":"3.51.4"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,5,13]],"date-time":"2022-05-13T00:00:00Z","timestamp":1652400000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,5,13]],"date-time":"2022-05-13T00:00:00Z","timestamp":1652400000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["TRR 154"],"award-info":[{"award-number":["TRR 154"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Bavarian State Government","award":["Energie Campus N\u00fcrnberg"],"award-info":[{"award-number":["Energie Campus N\u00fcrnberg"]}]},{"DOI":"10.13039\/501100006289","name":"\u00c9lectricit\u00e9 de France","doi-asserted-by":"publisher","award":["FMJH Program Gaspard Monge in optimization and operations research"],"award-info":[{"award-number":["FMJH Program Gaspard Monge in optimization and operations research"]}],"id":[{"id":"10.13039\/501100006289","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2022,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Bilevel optimization is an increasingly important tool to model hierarchical decision making. However, the ability of modeling such settings makes bilevel problems hard to solve in theory and practice. In this paper, we add on the general difficulty of this class of problems by further incorporating convex black-box constraints in the lower level. For this setup, we develop a cutting-plane algorithm that computes approximate bilevel-feasible points. We apply this method to a bilevel model of the European gas market in which we use a joint chance constraint to model uncertain loads. Since the chance constraint is not available in closed form, this fits into the black-box setting studied before. For the applied model, we use further problem-specific insights to derive bounds on the objective value of the bilevel problem. By doing so, we are able to show that we solve the application problem to approximate global optimality. In our numerical case study we are thus able to evaluate the welfare sensitivity in dependence of the achieved safety level of uncertain load coverage.<\/jats:p>","DOI":"10.1007\/s10898-022-01161-z","type":"journal-article","created":{"date-parts":[[2022,5,13]],"date-time":"2022-05-13T03:49:48Z","timestamp":1652413788000},"page":"651-685","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints"],"prefix":"10.1007","volume":"84","author":[{"given":"Holger","family":"Heitsch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren\u00e9","family":"Henrion","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Kleinert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6208-5677","authenticated-orcid":false,"given":"Martin","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,13]]},"reference":[{"key":"1161_CR1","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1137\/0913069","volume":"13.5","author":"P Hansen","year":"1992","unstructured":"Hansen, P., Jaumard, B., Savard, G.: New branch-and-bound rules for linear bilevel programming. SIAM J. Sci. Stat. Comput. 13.5, 1194\u20131217 (1992). https:\/\/doi.org\/10.1137\/0913069","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"1161_CR2","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF02191670","volume":"81.2","author":"L Vicente","year":"1994","unstructured":"Vicente, L., Savard, G., J\u00fadice, J.: Descent approaches for quadratic bilevel programming. J. Optim. Theory Appl. 81.2, 379\u2013399 (1994)","journal-title":"J. Optim. Theory Appl."},{"key":"1161_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45827-3","author":"S Dempe","year":"2015","unstructured":"Dempe, S., Kalashnikov, V., P\u00e9rez-Vald\u00e9s, G.A., Kalashnykova, N.: Bilevel Programming Problems. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-662-45827-3","journal-title":"Springer"},{"key":"1161_CR4","volume-title":"Foundations of Bilevel Programming","author":"S Dempe","year":"2002","unstructured":"Dempe, S.: Foundations of Bilevel Programming. Springer, Berlin (2002)"},{"key":"1161_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejco.2021.100007","author":"T Kleinert","year":"2021","unstructured":"Kleinert, T., Labb\u00e9, M., Ljubic, I., Schmidt, M.: A survey on mixed-integer programming techniques in bilevel optimization. EURO J. Comput. Optim. (2021). https:\/\/doi.org\/10.1016\/j.ejco.2021.100007","journal-title":"EURO J. Comput. Optim."},{"key":"1161_CR6","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1287\/opre.38.5.911","volume":"38.5","author":"JT Moore","year":"1990","unstructured":"Moore, J.T., Bard, J.F.: The mixed integer linear bilevel programming problem. Oper. Res. 38.5, 911\u2013921 (1990). https:\/\/doi.org\/10.1287\/opre.38.5.911","journal-title":"Oper. Res."},{"key":"1161_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10107-017-1189-5","volume":"172","author":"M Fischetti","year":"2018","unstructured":"Fischetti, M., Ljubic, I., Monaci, M., Sinnl, M.: On the use of intersection cuts for bilevel optimization. Math. Programm. 172, 77\u2013103 (2018). https:\/\/doi.org\/10.1007\/s10107-017-1189-5","journal-title":"Math. Programm."},{"key":"1161_CR8","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.cor.2013.07.016","volume":"41","author":"P Xu","year":"2014","unstructured":"Xu, P., Wang, L.: An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions. Comput. Oper. Res. 41, 309\u2013318 (2014). https:\/\/doi.org\/10.1016\/j.cor.2013.07.016","journal-title":"Comput. Oper. Res."},{"key":"1161_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-0-387-88843-9_4","volume-title":"Operations Research and Cyber-infrastructure","author":"ST DeNegre","year":"2009","unstructured":"DeNegre, S.T., Ralphs, T.K.: A branch-and-cut algorithm for integer bilevel linear programs. In: Operations Research and Cyber-infrastructure, pp. 65\u201378. Springer, Berlin (2009)"},{"key":"1161_CR10","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1287\/opre.2017.1650","volume":"65.6","author":"M Fischetti","year":"2017","unstructured":"Fischetti, M., Ljubic, I., Monaci, M., Sinnl, M.: A new general-purpose algorithm for mixed-integer bilevel linear programs. Oper. Res. 65.6, 1615\u20131637 (2017). https:\/\/doi.org\/10.1287\/opre.2017.1650","journal-title":"Oper. Res."},{"key":"1161_CR11","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10898-007-9260-z","volume":"42.4","author":"A Mitsos","year":"2008","unstructured":"Mitsos, A., Lemonidis, P., Barton, P.I.: Global solution of bilevel programs with a nonconvex inner program. J. Glob. Optim. 42.4, 475\u2013513 (2008). https:\/\/doi.org\/10.1007\/s10898-007-9260-z","journal-title":"J. Glob. Optim."},{"key":"1161_CR12","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s10898-009-9479-y","volume":"47.4","author":"A Mitsos","year":"2010","unstructured":"Mitsos, A.: Global solution of nonlinear mixed-integer bilevel programs. J. Glob. Optim. 47.4, 557\u2013582 (2010). https:\/\/doi.org\/10.1007\/s10898-009-9479-y","journal-title":"J. Glob. Optim."},{"key":"1161_CR13","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1137\/19M1242240","volume":"30.1","author":"J Burtscheidt","year":"2020","unstructured":"Burtscheidt, J., Claus, M., Dempe, S.: Risk-averse models in bilevel stochastic linear programming. SIAM J. Optim. 30.1, 377\u2013406 (2020). https:\/\/doi.org\/10.1137\/19M1242240","journal-title":"SIAM J. Optim."},{"key":"1161_CR14","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-030-52119-6_17","volume-title":"Bilevel Optimization: Advances and Next Challenges","author":"J Burtscheidt","year":"2020","unstructured":"Burtscheidt, J., Claus, M.: Bilevel linear optimization under uncertainty. In: Dempe, S., Zemkoho, A. (eds.) Bilevel Optimization: Advances and Next Challenges, pp. 485\u2013511. Springer, Berlin (2020)"},{"key":"1161_CR15","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1137\/16M1098486","volume":"28.1","author":"I Yanikoglu","year":"2018","unstructured":"Yanikoglu, I., Kuhn, D.: Decision rule bounds for two-stage stochastic bilevel programs. SIAM J. Optim. 28.1, 198\u2013222 (2018). https:\/\/doi.org\/10.1137\/16M1098486","journal-title":"SIAM J. Optim."},{"key":"1161_CR16","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1016\/j.artint.2010.07.002","volume":"174.15","author":"J Pita","year":"2010","unstructured":"Pita, J., Jain, M., Tambe, M., Ord\u00f3\u00f1ez, F., Kraus, S.: Robust solutions to Stackelberg games: addressing bounded rationality and limited observations in human cognition. Artif. Intell. 174.15, 1142\u20131171 (2010). https:\/\/doi.org\/10.1016\/j.artint.2010.07.002","journal-title":"Artif. Intell."},{"key":"1161_CR17","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1016\/j.orl.2021.07.010","volume":"49.5","author":"Y Beck","year":"2021","unstructured":"Beck, Y., Schmidt, M.: A robust approach for modeling limited observability in bilevel optimization. Oper. Res. Lett. 49.5, 752\u2013758 (2021). https:\/\/doi.org\/10.1016\/j.orl.2021.07.010","journal-title":"Oper. Res. Lett."},{"key":"1161_CR18","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-030-52119-6_5","volume-title":"Bilevel Optimization: Advances and Next Challenges","author":"S Wogrin","year":"2020","unstructured":"Wogrin, S., Pineda, S., Tejada-Arango, D.A.: Applications of bilevel optimization in energy and electricity markets. In: Dempe, S., Zemkoho, A. (eds.) Bilevel Optimization: Advances and Next Challenges, pp. 139\u2013168. Springer, Cham (2020)"},{"key":"1161_CR19","unstructured":"European Parliament and Council of the European Union. Directive 2009\/73\/EC of the European Parliament and of the Council concerning common rules for the internal market in natural gas and repealing Directive 2003\/55\/EC. (2009)"},{"key":"1161_CR20","unstructured":"European Parliament and Council of the European Union. Regulation No 715\/2009 of the European Parliament and of the Council on conditions for access to the natural gas transmission networks and repealing Regulation No 1775\/2005. July 13 (2009)"},{"key":"1161_CR21","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s00186-018-0647-z","volume":"89.2","author":"V Grimm","year":"2019","unstructured":"Grimm, V., Schewe, L., Schmidt, M., Z\u00f6ttl, G.: A multilevel model of the European entry-exit gas market. Math. Methods Oper. Res. 89.2, 223\u2013255 (2019). https:\/\/doi.org\/10.1007\/s00186-018-0647-z","journal-title":"Math. Methods Oper. Res."},{"key":"1161_CR22","doi-asserted-by":"publisher","unstructured":"Schewe, L., Schmidt, M., Th\u00fcrauf, J.: Global optimization for the multilevel European gas market system with nonlinear flow models on trees. J. Glob. Optim. (2021). https:\/\/doi.org\/10.1007\/s10898-021-01099-8. (Forthcoming)","DOI":"10.1007\/s10898-021-01099-8"},{"key":"1161_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.06.034","author":"T B\u00f6ttger","year":"2021","unstructured":"B\u00f6ttger, T., Grimm, V., Kleinert, T., Schmidt, M.: The cost of decoupling trade and transport in the European entry-exit gas market with linear physics modeling. Eur. J. Oper. Res. (2021). https:\/\/doi.org\/10.1016\/j.ejor.2021.06.034","journal-title":"Eur. J. Oper. Res."},{"key":"1161_CR24","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0167-6377(99)00052-8","volume":"25.4","author":"M Patriksson","year":"1999","unstructured":"Patriksson, M., Wynter, L.: Stochastic mathematical programs with equilibrium constraints. Oper. Res. Lett. 25.4, 159\u2013167 (1999). https:\/\/doi.org\/10.1016\/S0167-6377(99)00052-8","journal-title":"Oper. Res. Lett."},{"key":"1161_CR25","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1080\/02331930801954177","volume":"57.3","author":"A Shapiro","year":"2008","unstructured":"Shapiro, A., Xu, H.: Stochastic mathematical programs with equilibrium constraints, modelling and sample average approximation. Optimization 57.3, 395\u2013418 (2008). https:\/\/doi.org\/10.1080\/02331930801954177","journal-title":"Optimization"},{"key":"1161_CR26","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10492-007-0028-z","volume":"52.6","author":"R Henrion","year":"2007","unstructured":"Henrion, R., R\u00f6misch, W.: On M-stationary points for a stochastic equilibrium problem under equilibrium constraints in electricity spot market modeling. Appl. Math. 52.6, 473\u2013494 (2007). https:\/\/doi.org\/10.1007\/s10492-007-0028-z","journal-title":"Appl. Math."},{"key":"1161_CR27","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1134\/S1990478918040063","volume":"12.4","author":"S Ivanov","year":"2018","unstructured":"Ivanov, S.: A bilevel stochastic programming problem with random parameters in the follower\u2019s objective function. J. Appl. Ind. Math 12.4, 27\u201345 (2018). https:\/\/doi.org\/10.1134\/S1990478918040063","journal-title":"J. Appl. Ind. Math"},{"key":"1161_CR28","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1016\/j.camwa.2008.10.035","volume":"57.11","author":"J Yang","year":"2009","unstructured":"Yang, J., Zhang, M., He, B., Yang, C.: Bi-level programming model and hybrid genetic algorithm for flow interception problem with customer choice. Comput. Math. Appl. 57.11, 1985\u20131994 (2009). https:\/\/doi.org\/10.1016\/j.camwa.2008.10.035","journal-title":"Comput. Math. Appl."},{"key":"1161_CR29","first-page":"2417","volume":"2.4","author":"S Pramanik","year":"2012","unstructured":"Pramanik, S., Banerjee, D.: Chance constrained quadratic bi-level programming problem. Int. J. Modern Eng. Res. 2.4, 2417\u20132424 (2012)","journal-title":"Int. J. Modern Eng. Res."},{"key":"1161_CR30","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1137\/0108053","volume":"8.4","author":"JE Kelley Jr","year":"1960","unstructured":"Kelley, J.E., Jr.: The cutting-plane method for solving convex programs. J. Soc. Ind. Appl. Math. 8.4, 703\u2013712 (1960). https:\/\/doi.org\/10.1137\/0108053","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"1161_CR31","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36.3","author":"MA Duran","year":"1986","unstructured":"Duran, M.A., Grossmann, I.E.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36.3, 307\u2013339 (1986). https:\/\/doi.org\/10.1007\/BF02592064","journal-title":"Math. Program."},{"key":"1161_CR32","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF01581153","volume":"66.1","author":"R Fletcher","year":"1994","unstructured":"Fletcher, R., Leyffer, S.: Solving mixed integer nonlinear programs by outer approximation. Math. Program. 66.1, 327\u2013349 (1994). https:\/\/doi.org\/10.1007\/BF01581153","journal-title":"Math. Program."},{"key":"1161_CR33","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972672","author":"M Locatelli","year":"2013","unstructured":"Locatelli, M., Schoen, F.: Global optimization: theory, algorithms, and applications. SIAM (2013). https:\/\/doi.org\/10.1137\/1.9781611972672","journal-title":"SIAM"},{"key":"1161_CR34","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1016\/S0305-0548(97)00025-7","volume":"24.12","author":"CM Macal","year":"1997","unstructured":"Macal, C.M., Hurter, A.P.: Dependence of bilevel mathematical programs on irrelevant constraints. Comput. Oper. Res. 24.12, 1129\u20131140 (1997). https:\/\/doi.org\/10.1016\/S0305-0548(97)00025-7","journal-title":"Comput. Oper. Res."},{"key":"1161_CR35","unstructured":"Dempe, S., Lohse, S.: \u201cDependence Of Bilevel Programming On Irrelevant Data.\u201d Preprint. (2011)"},{"key":"1161_CR36","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0098-1354(90)87007-C","volume":"14.1","author":"P Clark","year":"1990","unstructured":"Clark, P., Westerberg, A.: Bilevel programming for steady-state chemical process design: I: fundamentals and algorithms. Comput. Chem. Eng. 14.1, 87\u201397 (1990). https:\/\/doi.org\/10.1016\/0098-1354(90)87007-C","journal-title":"Comput. Chem. Eng."},{"key":"1161_CR37","doi-asserted-by":"publisher","unstructured":"Paulavicius, R., Adjiman, C.S.: BASBLib: a library of bilevel test problems. (2019). https:\/\/doi.org\/10.5281\/zenodo.3266835","DOI":"10.5281\/zenodo.3266835"},{"key":"1161_CR38","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s11081-019-09447-0","volume":"21.1","author":"M Labb\u00e9","year":"2020","unstructured":"Labb\u00e9, M., Plein, F., Schmidt, M.: Bookings in the European gas market: characterisation of feasibility and computational complexity results. Optim. Eng. 21.1, 305\u2013334 (2020). https:\/\/doi.org\/10.1007\/s11081-019-09447-0","journal-title":"Optim. Eng."},{"key":"1161_CR39","doi-asserted-by":"publisher","DOI":"10.1002\/net.22003","author":"M Labb\u00e9","year":"2021","unstructured":"Labb\u00e9, M., Plein, F., Schmidt, M., Th\u00fcrauf, J.: Deciding feasibility of a booking in the European gas market on a cycle is in P. Networks (2021). https:\/\/doi.org\/10.1002\/net.22003","journal-title":"Networks"},{"key":"1161_CR40","unstructured":"Th\u00fcrauf, J.: Deciding the Feasibility of a Booking in the European Gas Market is coNP-hard. Tech. rep (2020). http:\/\/www.optimization-online.org\/DB_HTML\/2020\/05\/7803.html"},{"key":"1161_CR41","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)"},{"key":"1161_CR42","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1016\/j.ejor.2018.08.031","volume":"277.3","author":"I Yan\u0131koglu","year":"2019","unstructured":"Yan\u0131koglu, I., Gorissen, B.L., den Hertog, D.: A survey of adjustable robust optimization. Eur. J. Oper. Res. 277.3, 799\u2013813 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2018.08.031","journal-title":"Eur. J. Oper. Res."},{"key":"1161_CR43","volume-title":"Microeconomic Theory","author":"A Mas-Colell","year":"1995","unstructured":"Mas-Colell, A., Whinston, M.D., Green, J.R., et al.: Microeconomic Theory, vol. 1. Oxford University Press, New York (1995)"},{"key":"1161_CR44","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1115\/1.4059982","volume":"34.1349","author":"TR Weymouth","year":"1912","unstructured":"Weymouth, T.R.: Problems in natural gas engineering. Trans. Am. Soc. Mech. Eng. 34.1349, 185\u2013231 (1912)","journal-title":"Trans. Am. Soc. Mech. Eng."},{"key":"1161_CR45","doi-asserted-by":"publisher","unstructured":"F\u00fcgenschuh, A., Gei\u00dfler, B., Gollmer, R., Morsi, A., Pfetsch, M. E., R\u00f6vekamp, J., Schmidt, M., Spreckelsen, K., Steinbach, M. C.: \u201cPhysical and technical fundamentals of gas networks.\u201d In: Evaluating Gas Network Capacities. Ed. by T. Koch, B. Hiller, M. E. Pfetsch, and L. Schewe. SIAM-MOS series on Optimization. SIAM, 2015. Chap. 2, pp. 17\u201344. https:\/\/doi.org\/10.1137\/1.9781611973693.ch2","DOI":"10.1137\/1.9781611973693.ch2"},{"key":"1161_CR46","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-3087-7","volume-title":"Stochastic Programming","author":"A Pr\u00e9kopa","year":"1995","unstructured":"Pr\u00e9kopa, A.: Stochastic Programming. Kluwer, Dordrecht (1995)"},{"key":"1161_CR47","doi-asserted-by":"publisher","unstructured":"Genz, A., Bretz, F.: Computation of Multivariate Normal and t Probabilities. Lecture Notes in Statistics. Heidelberg: Springer-Verlag (2009). https:\/\/doi.org\/10.1007\/978-3-642-01689-9","DOI":"10.1007\/978-3-642-01689-9"},{"key":"1161_CR48","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s00186-010-0316-3","volume":"71","author":"W van Ackooij","year":"2010","unstructured":"van Ackooij, W., Henrion, R., M\u00f6ller, A., Zorgati, R.: On probabilistic constraints induced by rectangular sets and multivariate normal distributions. Math. Methods Oper. Res. 71, 535\u2013549 (2010). https:\/\/doi.org\/10.1007\/s00186-010-0316-3","journal-title":"Math. Methods Oper. Res."},{"key":"1161_CR49","doi-asserted-by":"publisher","first-page":"1864","DOI":"10.1137\/130922689","volume":"24.4","author":"W van Ackooij","year":"2014","unstructured":"van Ackooij, W., Henrion, R.: Gradient formulae for nonlinear probabilistic constraints with Gaussian and Gaussian-like distributions. SIAM J. Optim. 24.4, 1864\u20131889 (2014). https:\/\/doi.org\/10.1137\/130922689","journal-title":"SIAM J. Optim."},{"key":"1161_CR50","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1137\/16M1061308","volume":"5.1","author":"W van Ackooij","year":"2017","unstructured":"van Ackooij, W., Henrion, R.: (Sub-)Gradient formulae for probability functions of random inequality systems under Gaussian distribution. SIAM\/ASA J. Uncertain. Quantif. 5.1, 63\u201387 (2017). https:\/\/doi.org\/10.1137\/16M1061308","journal-title":"SIAM\/ASA J. Uncertain. Quantif."},{"key":"1161_CR51","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1080\/02331934.2019.1625353","volume":"69.3","author":"H Heitsch","year":"2020","unstructured":"Heitsch, H.: On probabilistic capacity maximization in a stationary gas network. Optimization 69.3, 575\u2013604 (2020). https:\/\/doi.org\/10.1080\/02331934.2019.1625353","journal-title":"Optimization"},{"key":"1161_CR52","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1057\/jors.1981.156","volume":"32.9","author":"J Fortuny-Amat","year":"1981","unstructured":"Fortuny-Amat, J., McCarl, B.: A representation and economic interpretation of a two-level programming problem. J. Oper. Res. Soc. 32.9, 783\u2013792 (1981). (JSTOR: 2581394)","journal-title":"J. Oper. Res. Soc."},{"key":"1161_CR53","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2019.2892607","author":"S Pineda","year":"2019","unstructured":"Pineda, S., Morales, J.M.: Solving linear bilevel problems using big-Ms: not all that glitters is gold. IEEE Trans. Power Syst. (2019). https:\/\/doi.org\/10.1109\/TPWRS.2019.2892607","journal-title":"IEEE Trans. Power Syst."},{"key":"1161_CR54","doi-asserted-by":"publisher","first-page":"1716","DOI":"10.1287\/opre.2019.1944","volume":"68.6","author":"T Kleinert","year":"2020","unstructured":"Kleinert, T., Labb\u00e9, M., Plein, F., Schmidt, M.: Technical note\u2013there\u2019s no free lunch: on the hardness of choosing a correct big-M in bilevel optimization. Oper. Res. 68.6, 1716\u20131721 (2020). https:\/\/doi.org\/10.1287\/opre.2019.1944","journal-title":"Oper. Res."},{"key":"1161_CR55","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s11067-012-9178-y","volume":"13.2","author":"S Siddiqui","year":"2013","unstructured":"Siddiqui, S., Gabriel, S.A.: An SOS1-based approach for solving MPECs with a natural gas market application. Netw. Spat. Econ. 13.2, 205\u2013227 (2013). https:\/\/doi.org\/10.1007\/s11067-012-9178-y","journal-title":"Netw. Spat. Econ."},{"key":"1161_CR56","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.disopt.2019.02.002","volume":"33","author":"T Kleinert","year":"2019","unstructured":"Kleinert, T., Schmidt, M.: Global optimization of multilevel electricity market models including network design and graph partitioning. Discret. Optim. 33, 43\u201369 (2019). https:\/\/doi.org\/10.1016\/j.disopt.2019.02.002","journal-title":"Discret. Optim."},{"key":"1161_CR57","volume-title":"Global Optimization: Deterministic Approaches","author":"R Horst","year":"2013","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches. Springer, Berlin (2013)"},{"key":"1161_CR58","doi-asserted-by":"publisher","unstructured":"Koch, T., Hiller, B., Pfetsch, M. E., Schewe, L.: Evaluating Gas Network Capacities. Ed. by M. E. Pfetsch, T. Koch, L. Schewe, and B. Hiller. Philadelphia, PA: Society for Industrial and Applied Mathematics (2015). https:\/\/doi.org\/10.1137\/1.9781611973693","DOI":"10.1137\/1.9781611973693"},{"key":"1161_CR59","unstructured":"Heitsch, H., Henrion, R., Kleinert, T., Schmidt, M.: Data repository. https:\/\/github.com\/m-schmidt-math-opt\/bilevel-w-chance-constr-lowerlevel. (2021)"},{"key":"1161_CR60","unstructured":"Regionales Rechenzentrum Erlangen. Woodcrest Cluster. https:\/\/hpc.fau.de\/systems-services\/systems-documentation-instructions\/clusters\/woody-cluster\/ (visited on 02\/15\/2021)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01161-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01161-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01161-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,24]],"date-time":"2024-09-24T17:08:39Z","timestamp":1727197719000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01161-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,13]]},"references-count":60,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["1161"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01161-z","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,13]]},"assertion":[{"value":"7 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}