{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T05:26:39Z","timestamp":1787289999481,"version":"build-2736575974"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T00:00:00Z","timestamp":1783900800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T00:00:00Z","timestamp":1783900800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["05M22UTB"],"award-info":[{"award-number":["05M22UTB"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2026,8]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The literature on pessimistic linear bilevel optimization with coupling constraints is rather scarce and it has been common sense that these problems are harder to tackle than pessimistic bilevel problems without coupling constraints. In this note, we show that this is not the case. To this end, given a pessimistic problem with coupling constraints, we derive a pessimistic problem without coupling constraints that has the same set of globally optimal solutions. Moreover, our results also show that one can equivalently replace a pessimistic problem with such constraints with an optimistic problem without coupling constraints. This paves the way of both transferring theory and solution techniques from any type of these problems to any other one.<\/jats:p>","DOI":"10.1007\/s10957-026-03026-x","type":"journal-article","created":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T05:30:16Z","timestamp":1783920616000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Coupling Constraints in Pessimistic Linear Bilevel Optimization"],"prefix":"10.1007","volume":"210","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9190-642X","authenticated-orcid":false,"given":"Dorothee","family":"Henke","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-2914-9850","authenticated-orcid":false,"given":"Henri","family":"Lefebvre","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6208-5677","authenticated-orcid":false,"given":"Martin","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johannes","family":"Th\u00fcrauf","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,13]]},"reference":[{"issue":"2","key":"3026_CR1","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1023\/A:1022645805569","volume":"93","author":"C Audet","year":"1997","unstructured":"Audet, C., Hansen, P., Jaumard, B., Savard, G.: Links between linear bilevel and mixed 0\u20131 programming problems. J. Optim. Theory Appl. 93(2), 273\u2013300 (1997). https:\/\/doi.org\/10.1023\/A:1022645805569","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"3026_CR2","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/s10957-018-01467-7","volume":"181","author":"D Aussel","year":"2019","unstructured":"Aussel, D., Svensson, A.: Is pessimistic bilevel programming a special case of a mathematical program with complementarity constraints? J. Optim. Theory Appl. 181(2), 504\u2013520 (2019). https:\/\/doi.org\/10.1007\/s10957-018-01467-7","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"3026_CR3","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ejor.2023.01.008","volume":"311","author":"Y Beck","year":"2023","unstructured":"Beck, Y., Ljubi\u0107, I., Schmidt, M.: A survey on bilevel optimization under uncertainty. Eur. J. Oper. Res. 311(2), 401\u2013426 (2023). https:\/\/doi.org\/10.1016\/j.ejor.2023.01.008","journal-title":"Eur. J. Oper. Res."},{"key":"3026_CR4","unstructured":"Beck, Y., Ljubi\u0107, I., Schmidt, M.: Linear and Mixed-Integer Bilevel Optimization: Theory and Algorithms. (2026) https:\/\/yasminebeck.github.io\/files\/bilevel-optimization-cup.pdf. Pre-publication version available online"},{"issue":"3","key":"3026_CR5","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF00940342","volume":"60","author":"HP Benson","year":"1989","unstructured":"Benson, H.P.: On the structure and properties of a linear multilevel programming problem. J. Optim. Theory Appl. 60(3), 353\u2013373 (1989). https:\/\/doi.org\/10.1007\/BF00940342","journal-title":"J. Optim. Theory Appl."},{"issue":"8","key":"3026_CR6","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1287\/mnsc.30.8.1004","volume":"30","author":"WF Bialas","year":"1984","unstructured":"Bialas, W.F., Karwan, M.H.: Two-level linear programming. Manage. Sci. 30(8), 1004\u20131020 (1984). https:\/\/doi.org\/10.1287\/mnsc.30.8.1004","journal-title":"Manage. Sci."},{"issue":"1","key":"3026_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1287\/opre.21.1.37","volume":"21","author":"J Bracken","year":"1973","unstructured":"Bracken, J., McGill, J.T.: Mathematical programs with optimization problems in the constraints. Oper. Res. 21(1), 37\u201344 (1973). https:\/\/doi.org\/10.1287\/opre.21.1.37","journal-title":"Oper. Res."},{"issue":"6","key":"3026_CR8","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1016\/j.orl.2023.10.006","volume":"51","author":"C Buchheim","year":"2023","unstructured":"Buchheim, C.: Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations. Oper. Res. Lett. 51(6), 618\u2013622 (2023). https:\/\/doi.org\/10.1016\/j.orl.2023.10.006","journal-title":"Oper. Res. Lett."},{"key":"3026_CR9","unstructured":"Candler, W., Norton, R.: Multi-level programming. Discussion Papers, Development Research Center, International Bank for Reconstruction and Development. World Bank, (1977). http:\/\/documents.worldbank.org\/curated\/en\/219041468315334935"},{"issue":"4","key":"3026_CR10","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1080\/02331934.2012.696641","volume":"63","author":"S Dempe","year":"2014","unstructured":"Dempe, S., Mordukhovich, B., Zemkoho, A.: Necessary optimality conditions in pessimistic bilevel programming. Optimization 63(4), 505\u2013533 (2014). https:\/\/doi.org\/10.1080\/02331934.2012.696641","journal-title":"Optimization"},{"key":"3026_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/b101970","author":"S Dempe","year":"2002","unstructured":"Dempe, S.: Foundations of Bilevel Programming. Springer (2002). https:\/\/doi.org\/10.1007\/b101970","journal-title":"Foundations of Bilevel Programming. Springer"},{"key":"3026_CR12","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":"Bilevel Programming Problems. Springer"},{"issue":"2","key":"3026_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5802\/ojmo.38","volume":"6","author":"M Goerigk","year":"2025","unstructured":"Goerigk, M., Kurtz, J., Schmidt, M., Th\u00fcrauf, J.: Connections between robust and bilevel optimization. Open Journal of Mathematical Optimization 6(2), 1\u201317 (2025). https:\/\/doi.org\/10.5802\/ojmo.38","journal-title":"Open Journal of Mathematical Optimization"},{"issue":"3","key":"3026_CR14","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/s11590-024-02156-3","volume":"19","author":"D Henke","year":"2025","unstructured":"Henke, D., Lefebvre, H., Schmidt, M., Th\u00fcrauf, J.: On coupling constraints in linear bilevel optimization. Optimization Letters 19(3), 689\u2013697 (2025). https:\/\/doi.org\/10.1007\/s11590-024-02156-3","journal-title":"Optimization Letters"},{"key":"3026_CR15","unstructured":"Lefebvre, H., Schmidt, M.: Exact augmented Lagrangian duality for nonconvex mixed-integer nonlinear optimization. (2024). https:\/\/optimizationonline.org\/?p=27046"},{"key":"3026_CR16","doi-asserted-by":"publisher","unstructured":"Marcotte, P., Savard, G.: Bilevel Programming: A Combinatorial Perspective. In: Graph Theory and Combinatorial Optimization. Ed. by D. Avis, A. Hertz, and O. Marcotte. Boston, MA: Springer US, (2005), pp. 191-217. https:\/\/doi.org\/10.1007\/0-387-25592-3_7.","DOI":"10.1007\/0-387-25592-3_7."},{"key":"3026_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejco.2025.100109","volume":"13","author":"O Stein","year":"2025","unstructured":"Stein, O.: A tutorial on properties of the epigraph reformulation. EURO Journal on Computational Optimization 13, 100109 (2025). https:\/\/doi.org\/10.1016\/j.ejco.2025.100109","journal-title":"EURO Journal on Computational Optimization"},{"issue":"4","key":"3026_CR18","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s12532-020-00183-6","volume":"12","author":"S Tahernejad","year":"2020","unstructured":"Tahernejad, S., Ralphs, T.K., DeNegre, S.T.: A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation. Math. Program. Comput. 12(4), 529\u2013568 (2020). https:\/\/doi.org\/10.1007\/s12532-020-00183-6","journal-title":"Math. Program. Comput."},{"issue":"3","key":"3026_CR19","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/BF02275351","volume":"89","author":"L Vicente","year":"1996","unstructured":"Vicente, L., Savard, G., J\u00fadice, J.: Discrete linear bilevel programming problem. J. Optim. Theory Appl. 89(3), 597\u2013614 (1996). https:\/\/doi.org\/10.1007\/BF02275351","journal-title":"J. Optim. Theory Appl."},{"key":"3026_CR20","volume-title":"Marktform und Gleichgewicht","author":"H von Stackelberg","year":"1934","unstructured":"von Stackelberg, H.: Marktform und Gleichgewicht. Springer (1934)"},{"key":"3026_CR21","volume-title":"Theory of the market economy","author":"H von Stackelberg","year":"1952","unstructured":"von Stackelberg, H.: Theory of the market economy. Oxford University Press (1952)"},{"issue":"1","key":"3026_CR22","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1137\/120864015","volume":"23","author":"W Wiesemann","year":"2013","unstructured":"Wiesemann, W., Tsoukalas, A., Kleniati, P.-M., Rustem, B.: Pessimistic bilevel optimization. SIAM J. Optim. 23(1), 353\u2013380 (2013). https:\/\/doi.org\/10.1137\/120864015","journal-title":"SIAM J. Optim."},{"key":"3026_CR23","doi-asserted-by":"publisher","unstructured":"Zeng, B.: A practical scheme to compute the pessimistic bilevel optimization problem. In: INFORMS Journal on Computing 32.4 (2020), pp. 1128-1142. https:\/\/doi.org\/10.1287\/ijoc.2019.0927.","DOI":"10.1287\/ijoc.2019.0927."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-026-03026-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-026-03026-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-026-03026-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T05:09:10Z","timestamp":1787288950000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-026-03026-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,13]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["3026"],"URL":"https:\/\/doi.org\/10.1007\/s10957-026-03026-x","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,13]]},"assertion":[{"value":"8 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"25"}}