{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T13:05:52Z","timestamp":1765976752557,"version":"3.37.3"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,1,27]],"date-time":"2024-01-27T00:00:00Z","timestamp":1706313600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,1,27]],"date-time":"2024-01-27T00:00:00Z","timestamp":1706313600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000140","name":"U.S. Department of Transportation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000140","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2024,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We investigate the concept of adjustability\u2014the difference in objective values between two types of dynamic robust optimization formulations: one where (static) decisions are made before uncertainty realization, and one where uncertainty is resolved before (adjustable) decisions. This difference reflects the value of information and decision timing in optimization under uncertainty, and is related to several other concepts such as the optimality of decision rules in robust optimization. We develop a theoretical framework to quantify adjustability based on the input data of a robust optimization problem with a linear objective, linear constraints, and fixed recourse. We make very few additional assumptions. In particular, we do not assume constraint-wise separability or parameter nonnegativity that are commonly imposed in the literature for the study of adjustability. This allows us to study important but previously under-investigated problems, such as formulations with equality constraints and problems with both upper and lower bound constraints. Based on the discovery of an interesting connection between the reformulations of the static and fully adjustable problems, our analysis gives a necessary and sufficient condition\u2014in the form of a theorem-of-the-alternatives\u2014for adjustability to be zero when the uncertainty set is polyhedral. Based on this sharp characterization, we provide two efficient mixed-integer optimization formulations to verify zero adjustability. Then, we develop a constructive approach to quantify adjustability when the uncertainty set is general, which results in an efficient and tight poly-time algorithm to bound adjustability. We demonstrate the efficiency and tightness via both theoretical and numerical analyses.<\/jats:p>","DOI":"10.1007\/s10107-023-02049-w","type":"journal-article","created":{"date-parts":[[2024,1,27]],"date-time":"2024-01-27T10:02:23Z","timestamp":1706349743000},"page":"581-628","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Adjustability in robust linear optimization"],"prefix":"10.1007","volume":"208","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2045-0979","authenticated-orcid":false,"given":"Ningji","family":"Wei","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0422-834X","authenticated-orcid":false,"given":"Peter","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,27]]},"reference":[{"key":"2049_CR1","doi-asserted-by":"crossref","unstructured":"An, L., Chakrabortty, A., Duel-Hallen, A.: A stackelberg security investment game for voltage stability of power systems. In: 2020 59th IEEE Conference on Decision and Control (CDC). IEEE, pp. 3359\u20133364 (2020)","DOI":"10.1109\/CDC42340.2020.9304301"},{"issue":"2","key":"2049_CR2","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1287\/opre.2016.1483","volume":"64","author":"A Ardestani-Jaafari","year":"2016","unstructured":"Ardestani-Jaafari, A., Delage, E.: Robust optimization of sums of piecewise linear functions with application to inventory problems. Oper. Res. 64(2), 474\u2013494 (2016)","journal-title":"Oper. Res."},{"issue":"3","key":"2049_CR3","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/ijoc.2020.0959","volume":"33","author":"A Ardestani-Jaafari","year":"2021","unstructured":"Ardestani-Jaafari, A., Delage, E.: Linearized robust counterparts of two-stage robust optimization problems with applications in operations management. INFORMS J. Comput. 33(3), 1138\u20131161 (2021)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"2049_CR4","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s10107-017-1222-8","volume":"173","author":"P Awasthi","year":"2019","unstructured":"Awasthi, P., Goyal, V., Lu, B.Y.: On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints. Math. Program. 173(1), 313\u2013352 (2019)","journal-title":"Math. Program."},{"key":"2049_CR5","doi-asserted-by":"crossref","unstructured":"Bampou, D., Kuhn, D.: Scenario-free stochastic programming with polynomial decision rules. In: 2011 50th IEEE Conference on Decision and Control and European Control Conference. IEEE, pp. 7806\u20137812 (2011)","DOI":"10.1109\/CDC.2011.6161150"},{"issue":"10","key":"2049_CR6","doi-asserted-by":"crossref","first-page":"4636","DOI":"10.1287\/mnsc.2018.3152","volume":"65","author":"C Bandi","year":"2019","unstructured":"Bandi, C., Han, E., Nohadani, O.: Sustainable inventory with robust periodic-affine policies and application to medical supply chains. Manag. Sci. 65(10), 4636\u20134655 (2019)","journal-title":"Manag. Sci."},{"issue":"1","key":"2049_CR7","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1287\/mnsc.2017.2948","volume":"65","author":"C Bandi","year":"2019","unstructured":"Bandi, C., Trichakis, N., Vayanos, P.: Robust multiclass queuing theory for wait time estimation in resource allocation systems. Manag. Sci. 65(1), 152\u2013187 (2019)","journal-title":"Manag. Sci."},{"issue":"3","key":"2049_CR8","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s101070100286","volume":"92","author":"A Ben-Tal","year":"2002","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust optimization-methodology and applications. Math. Program. 92(3), 453\u2013480 (2002)","journal-title":"Math. Program."},{"issue":"2","key":"2049_CR9","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10107-003-0454-y","volume":"99","author":"A Ben-Tal","year":"2004","unstructured":"Ben-Tal, A., Goryashko, A., Guslitzer, E., Nemirovski, A.: Adjustable robust solutions of uncertain linear programs. Math. Program. 99(2), 351\u2013376 (2004)","journal-title":"Math. Program."},{"key":"2049_CR10","doi-asserted-by":"crossref","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., Ghaoui, L.E., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)"},{"key":"2049_CR11","volume-title":"Dynamic Programming and Optimal Control","author":"D Bertsekas","year":"2012","unstructured":"Bertsekas, D.: Dynamic Programming and Optimal Control, vol. 1. Athena Scientific, Belmont (2012)"},{"issue":"2","key":"2049_CR12","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/moor.1090.0440","volume":"35","author":"D Bertsimas","year":"2010","unstructured":"Bertsimas, D., Goyal, V.: On the power of robust solutions in two-stage stochastic and adaptive optimization problems. Math. Oper. Res. 35(2), 284\u2013305 (2010)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"2049_CR13","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10107-011-0444-4","volume":"134","author":"D Bertsimas","year":"2012","unstructured":"Bertsimas, D., Goyal, V.: On the power and limitations of affine policies in two-stage adaptive optimization. Math. Program. 134(2), 491\u2013531 (2012)","journal-title":"Math. Program."},{"key":"2049_CR14","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s00186-012-0405-6","volume":"77","author":"D Bertsimas","year":"2013","unstructured":"Bertsimas, D., Goyal, V.: On the approximability of adjustable robust convex optimization under uncertainty. Math. Methods Oper. Res. 77, 323\u2013343 (2013)","journal-title":"Math. Methods Oper. Res."},{"issue":"1","key":"2049_CR15","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D Bertsimas","year":"2003","unstructured":"Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Math. Program. 98(1), 49\u201371 (2003)","journal-title":"Math. Program."},{"issue":"1","key":"2049_CR16","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35\u201353 (2004)","journal-title":"Oper. Res."},{"issue":"1","key":"2049_CR17","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/opre.1050.0238","volume":"54","author":"D Bertsimas","year":"2006","unstructured":"Bertsimas, D., Thiele, A.: A robust optimization approach to inventory theory. Oper. Res. 54(1), 150\u2013168 (2006)","journal-title":"Oper. Res."},{"issue":"2","key":"2049_CR18","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/moor.1100.0444","volume":"35","author":"D Bertsimas","year":"2010","unstructured":"Bertsimas, D., Iancu, D.A., Parrilo, P.A.: Optimality of affine policies in multistage robust optimization. Math. Oper. Res. 35(2), 363\u2013394 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"2049_CR19","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1287\/moor.1110.0482","volume":"36","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Goyal, V., Sun, X.A.: A geometric characterization of the power of finite adaptability in multistage stochastic and adaptive optimization. Math. Oper. Res. 36(1), 24\u201354 (2011)","journal-title":"Math. Oper. Res."},{"issue":"12","key":"2049_CR20","doi-asserted-by":"crossref","first-page":"2809","DOI":"10.1109\/TAC.2011.2162878","volume":"56","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Iancu, D.A., Parrilo, P.A.: A hierarchy of near-optimal policies for multistage adaptive optimization. IEEE Trans. Autom. Control 56(12), 2809\u20132824 (2011)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"2","key":"2049_CR21","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s10107-014-0768-y","volume":"150","author":"D Bertsimas","year":"2015","unstructured":"Bertsimas, D., Goyal, V., Lu, B.Y.: A tight characterization of the performance of static solutions in two-stage adjustable robust linear optimization. Math. Program. 150(2), 281\u2013319 (2015)","journal-title":"Math. Program."},{"issue":"2","key":"2049_CR22","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10107-017-1125-8","volume":"167","author":"D Bertsimas","year":"2018","unstructured":"Bertsimas, D., Gupta, V., Kallus, N.: Data-driven robust optimization. Math. Program. 167(2), 235\u2013292 (2018)","journal-title":"Math. Program."},{"issue":"6","key":"2049_CR23","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1287\/opre.38.6.1019","volume":"38","author":"DJ Bertsimas","year":"1990","unstructured":"Bertsimas, D.J., Jaillet, P., Odoni, A.R.: A priori optimization. Oper. Res. 38(6), 1019\u20131033 (1990)","journal-title":"Oper. Res."},{"issue":"6","key":"2049_CR24","doi-asserted-by":"crossref","first-page":"1469","DOI":"10.1287\/opre.1080.0605","volume":"57","author":"X Chen","year":"2009","unstructured":"Chen, X., Zhang, Y.: Uncertain linear programs: extended affinely adjustable robust counterparts. Oper. Res. 57(6), 1469\u20131482 (2009)","journal-title":"Oper. Res."},{"issue":"2","key":"2049_CR25","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/opre.1070.0457","volume":"56","author":"X Chen","year":"2008","unstructured":"Chen, X., Sim, M., Sun, P., Zhang, J.: A linear decision-based approximation approach to stochastic programming. Oper. Res. 56(2), 344\u2013357 (2008)","journal-title":"Oper. Res."},{"issue":"3","key":"2049_CR26","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1287\/opre.1090.0741","volume":"58","author":"E Delage","year":"2010","unstructured":"Delage, E., Ye, Y.: Distributionally robust optimization under moment uncertainty with application to data-driven problems. Oper. Res. 58(3), 595\u2013612 (2010)","journal-title":"Oper. Res."},{"key":"2049_CR27","unstructured":"El\u00a0Housni, O., Goyal, V.: Beyond worst-case: a probabilistic analysis of affine policies in dynamic optimization. In: Advances in Neural Information Processing Systems, vol. 30 (2017)"},{"issue":"2","key":"2049_CR28","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1287\/moor.2020.1082","volume":"46","author":"O El Housni","year":"2021","unstructured":"El Housni, O., Goyal, V.: On the optimality of affine policies for budgeted uncertainty sets. Math. Oper. Res. 46(2), 674\u2013711 (2021)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"2049_CR29","doi-asserted-by":"crossref","first-page":"884","DOI":"10.1007\/s13235-018-00291-y","volume":"9","author":"SR Etesami","year":"2019","unstructured":"Etesami, S.R., Ba\u015far, T.: Dynamic games in cyber-physical security: an overview. Dyn. Games Appl. 9(4), 884\u2013913 (2019)","journal-title":"Dyn. Games Appl."},{"issue":"3","key":"2049_CR30","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1287\/opre.2018.1835","volume":"67","author":"A Georghiou","year":"2019","unstructured":"Georghiou, A., Tsoukalas, A., Wiesemann, W.: Robust dual dynamic programming. Oper. Res. 67(3), 813\u2013830 (2019)","journal-title":"Oper. Res."},{"issue":"4","key":"2049_CR31","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1287\/opre.51.4.543.16101","volume":"51","author":"LE Ghaoui","year":"2003","unstructured":"Ghaoui, L.E., Oks, M., Oustry, F.: Worst-case value-at-risk and robust portfolio optimization: a conic programming approach. Oper. Res. 51(4), 543\u2013556 (2003)","journal-title":"Oper. Res."},{"issue":"1","key":"2049_CR32","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s10479-018-2954-4","volume":"269","author":"A Haddad-Sisakht","year":"2018","unstructured":"Haddad-Sisakht, A., Ryan, S.M.: Conditions under which adjustability lowers the cost of a robust linear program. Ann. Oper. Res. 269(1), 185\u2013204 (2018)","journal-title":"Ann. Oper. Res."},{"key":"2049_CR33","unstructured":"Gurobi (2023) Solving bilinear programming problems. https:\/\/www.gurobi.com\/events\/solving-bilinear-programming-problems\/. Accessed 14 Sept 2023"},{"key":"2049_CR34","doi-asserted-by":"crossref","unstructured":"Hadjiyiannis, M.J., Goulart, P.J., Kuhn, D.: A scenario approach for estimating the suboptimality of linear decision rules in two-stage robust optimization. In: 2011 50th IEEE Conference on Decision and Control and European Control Conference. IEEE, pp. 7386\u20137391 (2011)","DOI":"10.1109\/CDC.2011.6161342"},{"issue":"4","key":"2049_CR35","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1287\/opre.2015.1392","volume":"63","author":"GA Hanasusanto","year":"2015","unstructured":"Hanasusanto, G.A., Kuhn, D., Wiesemann, W.: K-adaptability in two-stage robust binary programming. Oper. Res. 63(4), 877\u2013891 (2015)","journal-title":"Oper. Res."},{"key":"2049_CR36","doi-asserted-by":"crossref","unstructured":"Housni, O.E., Foussoul, A., Goyal, V.: LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization. In: Integer Programming and Combinatorial Optimization: 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27\u201329, 2022, Proceedings. Springer, pp. 223\u2013236 (2022)","DOI":"10.1007\/978-3-031-06901-7_17"},{"issue":"4","key":"2049_CR37","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1287\/opre.2013.1172","volume":"61","author":"DA Iancu","year":"2013","unstructured":"Iancu, D.A., Sharma, M., Sviridenko, M.: Supermodularity and affine policies in dynamic robust optimization. Oper. Res. 61(4), 941\u2013956 (2013)","journal-title":"Oper. Res."},{"issue":"7","key":"2049_CR38","doi-asserted-by":"crossref","first-page":"4233","DOI":"10.1287\/mnsc.2020.3736","volume":"67","author":"DA Iancu","year":"2021","unstructured":"Iancu, D.A., Trichakis, N., Yoon, D.Y.: Monitoring with limited information. Manag. Sci. 67(7), 4233\u20134251 (2021)","journal-title":"Manag. Sci."},{"issue":"2","key":"2049_CR39","first-page":"97","volume":"40","author":"E Israeli","year":"2002","unstructured":"Israeli, E., Wood, R.K.: Shortest-path network interdiction. Netw. Int. J. 40(2), 97\u2013111 (2002)","journal-title":"Netw. Int. J."},{"key":"2049_CR40","unstructured":"IBM (2017) Performance tuning for cplex\u2019s spatial branchand-bound solver for global nonconvex (mixed integer) quadratic programs. http:\/\/orwe-conference.mines.edu\/files\/IOS2018SpatialPerfTuning.pdf. Accessed 14 Sept 2023"},{"issue":"2","key":"2049_CR41","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1016\/j.ejor.2016.10.049","volume":"259","author":"RA Konrad","year":"2017","unstructured":"Konrad, R.A., Trapp, A.C., Palmbach, T.M., Blom, J.S.: Overcoming human trafficking via operations research and analytics: opportunities for methods, models, and applications. Eur. J. Oper. Res. 259(2), 733\u2013745 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"2049_CR42","doi-asserted-by":"crossref","first-page":"1646","DOI":"10.1002\/aic.15183","volume":"62","author":"NH Lappas","year":"2016","unstructured":"Lappas, N.H., Gounaris, C.E.: Multi-stage adjustable robust optimization for process scheduling under uncertainty. AIChE J. 62(5), 1646\u20131667 (2016)","journal-title":"AIChE J."},{"issue":"2","key":"2049_CR43","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/s10107-017-1166-z","volume":"170","author":"A Marandi","year":"2018","unstructured":"Marandi, A., Den Hertog, D.: When are static and adjustable robust optimization problems with constraint-wise uncertainty equivalent? Math. Program. 170(2), 555\u2013568 (2018)","journal-title":"Math. Program."},{"issue":"1","key":"2049_CR44","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.cor.2007.09.004","volume":"36","author":"TC Matisziw","year":"2009","unstructured":"Matisziw, T.C., Murray, A.T.: Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure. Comput. Oper. Res. 36(1), 16\u201326 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"2049_CR45","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: Part i-convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976)","journal-title":"Math. Program."},{"issue":"1","key":"2049_CR46","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01448847","volume":"100","author":"Neumann Jv","year":"1928","unstructured":"Jv, Neumann: Zur theorie der gesellschaftsspiele. Math. Ann. 100(1), 295\u2013320 (1928)","journal-title":"Math. Ann."},{"issue":"5","key":"2049_CR47","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1287\/opre.1050.0216","volume":"53","author":"A Nilim","year":"2005","unstructured":"Nilim, A., El Ghaoui, L.: Robust control of Markov decision processes with uncertain transition matrices. Oper. Res. 53(5), 780\u2013798 (2005)","journal-title":"Oper. Res."},{"issue":"5","key":"2049_CR48","doi-asserted-by":"crossref","first-page":"2906","DOI":"10.1287\/opre.2021.2159","volume":"70","author":"M Poursoltani","year":"2022","unstructured":"Poursoltani, M., Delage, E.: Adjustable robust optimization reformulations of two-stage worst-case regret minimization problems. Oper. Res. 70(5), 2906\u20132930 (2022)","journal-title":"Oper. Res."},{"key":"2049_CR49","series-title":"Princeton Mathematical Series","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton Mathematical Series, Princeton University Press, Princeton (1970)"},{"key":"2049_CR50","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/j.compchemeng.2017.07.004","volume":"106","author":"C Shang","year":"2017","unstructured":"Shang, C., Huang, X., You, F.: Data-driven robust optimization based on kernel learning. Comput. Chem. Eng. 106, 464\u2013479 (2017)","journal-title":"Comput. Chem. Eng."},{"key":"2049_CR51","unstructured":"SCIP (2018) Minlp and stronger relaxation of bilinear terms. https:\/\/www.scipopt.org\/workshop2018\/slides\/SCIP-Workshop-Felipe-Serrano.pdf. Accessed 14 Sept 2023"},{"issue":"4","key":"2049_CR52","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF00122429","volume":"2","author":"HD Sherali","year":"1992","unstructured":"Sherali, H.D., Alameddine, A.: A new reformulation-linearization technique for bilinear programming problems. J. Global Optim. 2(4), 379\u2013410 (1992)","journal-title":"J. Global Optim."},{"key":"2049_CR53","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1016\/j.renene.2020.02.027","volume":"153","author":"R Shi","year":"2020","unstructured":"Shi, R., Li, S., Zhang, P., Lee, K.Y.: Integration of renewable energy sources and electric vehicles in V2G network with adjustable robust optimization. Renew. Energy 153, 1067\u20131080 (2020)","journal-title":"Renew. Energy"},{"issue":"5","key":"2049_CR54","doi-asserted-by":"crossref","first-page":"1246","DOI":"10.1287\/opre.2019.1862","volume":"67","author":"D Simchi-Levi","year":"2019","unstructured":"Simchi-Levi, D., Trichakis, N., Zhang, P.Y.: Designing response supply chain against bioattacks. Oper. Res. 67(5), 1246\u20131268 (2019)","journal-title":"Oper. Res."},{"issue":"2","key":"2049_CR55","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10957-007-9288-8","volume":"136","author":"A Takeda","year":"2008","unstructured":"Takeda, A., Taguchi, S., T\u00fct\u00fcnc\u00fc, R.: Adjustable robust optimization models for a nonlinear two-period system. J. Optim. Theory Appl. 136(2), 275\u2013295 (2008)","journal-title":"J. Optim. Theory Appl."},{"key":"2049_CR56","unstructured":"Tsaknakis, I., Hong, M., Zhang, S.: Minimax problems with coupled linear constraints: computational complexity, duality and solution methods (2021). arXiv preprint arXiv:2110.11210"},{"issue":"4","key":"2049_CR57","doi-asserted-by":"crossref","first-page":"1081","DOI":"10.1007\/s11590-021-01717-0","volume":"15","author":"N Wei","year":"2021","unstructured":"Wei, N., Walteros, J.L., Worden, M.R., Ortiz-Pe\u00f1a, H.J.: A resiliency analysis of information distribution policies over mobile ad hoc networks. Optim. Lett. 15(4), 1081\u20131103 (2021)","journal-title":"Optim. Lett."},{"issue":"6","key":"2049_CR58","doi-asserted-by":"crossref","first-page":"1358","DOI":"10.1287\/opre.2014.1314","volume":"62","author":"W Wiesemann","year":"2014","unstructured":"Wiesemann, W., Kuhn, D., Sim, M.: Distributionally robust convex optimization. Oper. Res. 62(6), 1358\u20131376 (2014)","journal-title":"Oper. Res."},{"issue":"3","key":"2049_CR59","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1016\/j.ejor.2018.08.031","volume":"277","author":"\u00cdhsan Yan\u0131ko\u01e7lu","year":"2019","unstructured":"Yan\u0131ko\u01e7lu, \u00cdhsan., Gorissen, B.L., den Hertog, D.: A survey of adjustable robust optimization. Eur. J. Oper. Res. 277(3), 799\u2013813 (2019)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"2049_CR60","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.2017.1714","volume":"66","author":"J Zhen","year":"2018","unstructured":"Zhen, J., Den Hertog, D., Sim, M.: Adjustable robust optimization via Fourier\u2013Motzkin elimination. Oper. Res. 66(4), 1086\u20131100 (2018)","journal-title":"Oper. Res."},{"issue":"5","key":"2049_CR61","doi-asserted-by":"crossref","first-page":"2410","DOI":"10.1287\/ijoc.2022.1163","volume":"34","author":"J Zhen","year":"2022","unstructured":"Zhen, J., Marandi, A., de Moor, D., den Hertog, D., Vandenberghe, L.: Disjoint bilinear optimization: a two-stage robust optimization perspective. INFORMS J. Comput. 34(5), 2410\u20132427 (2022)","journal-title":"INFORMS J. Comput."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-02049-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-023-02049-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-02049-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T16:10:01Z","timestamp":1729008601000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-023-02049-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,27]]},"references-count":61,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["2049"],"URL":"https:\/\/doi.org\/10.1007\/s10107-023-02049-w","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2024,1,27]]},"assertion":[{"value":"7 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}