{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:58:13Z","timestamp":1757311093684,"version":"3.37.3"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T00:00:00Z","timestamp":1699488000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T00:00:00Z","timestamp":1699488000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Czech Science Foundation Grant","award":["P403-22-11117S"],"award-info":[{"award-number":["P403-22-11117S"]}]},{"name":"Logistics and Distribution Institute at the University of Louisville"},{"name":"Logistics and Distribution Institute at the University of Louisville"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s10957-023-02311-3","type":"journal-article","created":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T17:02:31Z","timestamp":1699549351000},"page":"955-992","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Quantifying Outcome Functions of Linear Programs: An Approach Based on Interval-Valued Right-Hand Sides"],"prefix":"10.1007","volume":"199","author":[{"given":"Mohsen","family":"Mohammadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3895-0629","authenticated-orcid":false,"given":"Monica","family":"Gentili","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milan","family":"Hlad\u00edk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raffaele","family":"Cerulli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,9]]},"reference":[{"issue":"8","key":"2311_CR1","doi-asserted-by":"publisher","first-page":"1893","DOI":"10.1007\/s11590-012-0530-4","volume":"7","author":"M Allahdadi","year":"2013","unstructured":"Allahdadi, M., Nehi, H.M.: The optimal solution set of the interval linear programming problems. Optim. Lett. 7(8), 1893\u20131911 (2013). https:\/\/doi.org\/10.1007\/s11590-012-0530-4","journal-title":"Optim. Lett."},{"issue":"4","key":"2311_CR2","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1287\/opre.1070.0428","volume":"55","author":"A Atamt\u00fcrk","year":"2007","unstructured":"Atamt\u00fcrk, A., Zhang, M.: Two-stage robust network flow and design under demand uncertainty. Oper. Res. 55(4), 662\u2013673 (2007). https:\/\/doi.org\/10.1287\/opre.1070.0428","journal-title":"Oper. Res."},{"key":"2311_CR3","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, vol. 28. Princeton University Press, Princeton (2009)"},{"issue":"2","key":"2311_CR4","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/s10107-011-0444-4","journal-title":"Math. Program."},{"key":"2311_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to Stochastic Programming","author":"JR Birge","year":"2011","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, Berlin (2011)"},{"key":"2311_CR6","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1287\/mnsc.26.7.694","volume":"26","author":"GR Bitran","year":"1980","unstructured":"Bitran, G.R.: Linear multiple objective problems with interval coefficients. Manag. Sci. 26, 694\u2013706 (1980)","journal-title":"Manag. Sci."},{"issue":"3","key":"2311_CR7","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1016\/j.ejor.2016.02.037","volume":"260","author":"N Boland","year":"2017","unstructured":"Boland, N., Charkhgard, H., Savelsbergh, M.: A new method for optimizing a linear function over the efficient set of a multiobjective integer program. Eur. J. Oper. Res. 260(3), 904\u2013919 (2017). https:\/\/doi.org\/10.1016\/j.ejor.2016.02.037","journal-title":"Eur. J. Oper. Res."},{"key":"2311_CR8","doi-asserted-by":"publisher","unstructured":"Cerulli, R., D\u2019Ambrosio, C., Gentili, M.: Best and worst values of the optimal cost of the interval transportation problem. In: International Conference on Optimization and Decision Science, pp. 367\u2013374. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-67308-0_37","DOI":"10.1007\/978-3-319-67308-0_37"},{"issue":"1","key":"2311_CR9","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s00477-015-1187-1","volume":"31","author":"G Cheng","year":"2017","unstructured":"Cheng, G., Huang, G., Dong, C.: Convex contractive interval linear programming for resources and environmental systems management. Stoch. Environ. Res. Risk Assess. 31(1), 205\u2013224 (2017). https:\/\/doi.org\/10.1007\/s00477-015-1187-1","journal-title":"Stoch. Environ. Res. Risk Assess."},{"issue":"2","key":"2311_CR10","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1057\/palgrave.jors.2600891","volume":"51","author":"J Chinneck","year":"2000","unstructured":"Chinneck, J., Ramadan, K.: Linear programming with interval coefficients. J. Oper. Res. Soc. 51(2), 209\u2013220 (2000). https:\/\/doi.org\/10.1057\/palgrave.jors.2600891","journal-title":"J. Oper. Res. Soc."},{"key":"2311_CR11","unstructured":"Curry, S.: Statistical inference for optimization models: sensitivity analysis and uncertainty quantification (2019). Ph.D. thesis, Georgia Institute of Technology, School of Industrial and Systems Engineering, Atlanta, US. http:\/\/hdl.handle.net\/1853\/62265"},{"key":"2311_CR12","doi-asserted-by":"publisher","first-page":"102,059","DOI":"10.1016\/j.omega.2019.04.002","volume":"95","author":"C D\u2019Ambrosio","year":"2020","unstructured":"D\u2019Ambrosio, C., Gentili, M., Cerulli, R.: The optimal value range problem for the interval (immune) transportation problem. Omega 95, 102,059 (2020). https:\/\/doi.org\/10.1016\/j.omega.2019.04.002","journal-title":"Omega"},{"issue":"6","key":"2311_CR13","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/s10951-010-0163-3","volume":"13","author":"J Fortin","year":"2010","unstructured":"Fortin, J., Zieli\u0144ski, P., Dubois, D., Fargier, H.: Criticality analysis of activity networks under interval uncertainty. J. Sched. 13(6), 609\u2013627 (2010). https:\/\/doi.org\/10.1007\/s10951-010-0163-3","journal-title":"J. Sched."},{"issue":"3","key":"2311_CR14","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1111\/j.1475-3995.2009.00737.x","volume":"17","author":"V Gabrel","year":"2010","unstructured":"Gabrel, V., Murat, C., Remli, N.: Linear programming with interval right hand sides. Int. Trans. Oper. Res. 17(3), 397\u2013408 (2010). https:\/\/doi.org\/10.1111\/j.1475-3995.2009.00737.x","journal-title":"Int. Trans. Oper. Res."},{"key":"2311_CR15","unstructured":"Garajov\u00e1, E.: The optimal solution set of interval linear programming problems. Master\u2019s thesis, Charles Univesity, Faculty of Mathematics and Physics, Prague, Czech Republic. https:\/\/is.cuni.cz\/webapps\/zzp\/detail\/168259\/?lang=en (2016)"},{"issue":"1","key":"2311_CR16","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s10589-018-0029-8","volume":"72","author":"E Garajov\u00e1","year":"2019","unstructured":"Garajov\u00e1, E., Hlad\u00edk, M.: On the optimal solution set in interval linear programming. Comput. Optim. Appl. 72(1), 269\u2013292 (2019). https:\/\/doi.org\/10.1007\/s10589-018-0029-8","journal-title":"Comput. Optim. Appl."},{"key":"2311_CR17","doi-asserted-by":"publisher","unstructured":"Garajov\u00e1, E., Hlad\u00edk, M., Rada, M.: On the properties of interval linear programs with a fixed coefficient matrix. In: International Conference on Optimization and Decision Science, pp. 393\u2013401. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-67308-0_40","DOI":"10.1007\/978-3-319-67308-0_40"},{"key":"2311_CR18","doi-asserted-by":"publisher","first-page":"209","DOI":"10.17535\/crorr.2019.0018","volume":"201","author":"E Garajov\u00e1","year":"2019","unstructured":"Garajov\u00e1, E., Hlad\u00edk, M., Rada, M.: The best, the worst and the semi-strong: optimal values in interval linear programming. Croat. Oper. Res. Rev. 201, 209 (2019). https:\/\/doi.org\/10.17535\/crorr.2019.0018","journal-title":"Croat. Oper. Res. Rev."},{"issue":"3","key":"2311_CR19","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/s10100-018-0580-5","volume":"27","author":"E Garajov\u00e1","year":"2019","unstructured":"Garajov\u00e1, E., Hlad\u00edk, M., Rada, M.: Interval linear programming under transformations: optimal solutions and optimal value range. CEJOR 27(3), 601\u2013614 (2019). https:\/\/doi.org\/10.1007\/s10100-018-0580-5","journal-title":"CEJOR"},{"issue":"8","key":"2311_CR20","doi-asserted-by":"publisher","first-page":"1470","DOI":"10.2105\/AJPH.2016.303222","volume":"106","author":"M Gentili","year":"2016","unstructured":"Gentili, M., Harati, P., Serban, N.: Projecting the impact of the affordable care act provisions on accessibility and availability of primary care providers for the adult population in Georgia. Am. J. Public Health 106(8), 1470\u20131476 (2016). https:\/\/doi.org\/10.2105\/AJPH.2016.303222","journal-title":"Am. J. Public Health"},{"issue":"3","key":"2311_CR21","doi-asserted-by":"publisher","first-page":"1458","DOI":"10.1111\/1475-6773.12722","volume":"53","author":"M Gentili","year":"2018","unstructured":"Gentili, M., Harati, P., Serban, N., O\u2019connor, J., Swann, J.: Quantifying disparities in accessibility and availability of pediatric primary care across multiple states with implications for targeted interventions. Health Serv. Res. 53(3), 1458\u20131477 (2018). https:\/\/doi.org\/10.1111\/1475-6773.12722","journal-title":"Health Serv. Res."},{"issue":"5","key":"2311_CR22","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1007\/s11524-015-9972-1","volume":"92","author":"M Gentili","year":"2015","unstructured":"Gentili, M., Isett, K., Serban, N., Swann, J.: Small-area estimation of spatial access to care and its implications for policy. J. Urban Health 92(5), 864\u2013909 (2015). https:\/\/doi.org\/10.1007\/s11524-015-9972-1","journal-title":"J. Urban Health"},{"issue":"5","key":"2311_CR23","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1137\/0913069","volume":"13","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."},{"issue":"3","key":"2311_CR24","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10700-009-9060-7","volume":"8","author":"M Hlad\u00edk","year":"2009","unstructured":"Hlad\u00edk, M.: Optimal value range in interval linear programming. Fuzzy Optim. Decis. Mak. 8(3), 283\u2013294 (2009). https:\/\/doi.org\/10.1007\/s10700-009-9060-7","journal-title":"Fuzzy Optim. Decis. Mak."},{"issue":"5","key":"2311_CR25","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1007\/s11590-011-0315-1","volume":"6","author":"M Hlad\u00edk","year":"2012","unstructured":"Hlad\u00edk, M.: Complexity of necessary efficiency in interval linear programming and multiobjective linear programming. Optim. Lett. 6(5), 893\u2013899 (2012). https:\/\/doi.org\/10.1007\/s11590-011-0315-1","journal-title":"Optim. Lett."},{"key":"2311_CR26","first-page":"85","volume-title":"Chapter 2. Linear Programming-New Frontiers in Theory and Applications","author":"M Hlad\u00edk","year":"2012","unstructured":"Hlad\u00edk, M.: Interval linear programming: a survey. In: Mann, Z.A. (ed.) Chapter 2. Linear Programming-New Frontiers in Theory and Applications, pp. 85\u2013120. Nova Science Publishers, New York (2012)"},{"key":"2311_CR27","unstructured":"Hlad\u00edk, M.: An interval linear programming contractor. In: Ramik, J., Stavarek, D. (eds.) Proceedings 30th International Conference on Mathematical Methods in Economics 2012, Karvina, Czech Republic pp. 284\u2013289. Silesian University in Opava (2012)"},{"issue":"1","key":"2311_CR28","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s11590-012-0589-y","volume":"8","author":"M Hlad\u00edk","year":"2014","unstructured":"Hlad\u00edk, M.: How to determine basis stability in interval linear programming. Optim. Lett. 8(1), 375\u2013389 (2014). https:\/\/doi.org\/10.1007\/s11590-012-0589-y","journal-title":"Optim. Lett."},{"issue":"7","key":"2311_CR29","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1007\/s11590-013-0715-5","volume":"8","author":"M Hlad\u00edk","year":"2014","unstructured":"Hlad\u00edk, M.: On approximation of the best case optimal value in interval linear programming. Optim. Lett. 8(7), 1985\u20131997 (2014). https:\/\/doi.org\/10.1007\/s11590-013-0715-5","journal-title":"Optim. Lett."},{"issue":"2","key":"2311_CR30","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1080\/03081087.2016.1180339","volume":"65","author":"M Hlad\u00edk","year":"2017","unstructured":"Hlad\u00edk, M.: Transformations of interval linear systems of equations and inequalities. Linear Multilinear Algebra 65(2), 211\u2013223 (2017). https:\/\/doi.org\/10.1080\/03081087.2016.1180339","journal-title":"Linear Multilinear Algebra"},{"issue":"2","key":"2311_CR31","doi-asserted-by":"publisher","first-page":"245","DOI":"10.17535\/crorr.2018.0019","volume":"9","author":"M Hlad\u00edk","year":"2018","unstructured":"Hlad\u00edk, M.: The worst case finite optimal value in interval linear programming. Croat. Oper. Res. Rev. 9(2), 245\u2013254 (2018). https:\/\/doi.org\/10.17535\/crorr.2018.0019","journal-title":"Croat. Oper. Res. Rev."},{"key":"2311_CR32","doi-asserted-by":"publisher","unstructured":"Hlad\u00edk, M.: Two approaches to inner estimations of the optimal solution set in interval linear programming. In: Proceedings of the 2020 4th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence, ISMSI \u201920, pp. 99\u2013104. Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3396474.3396479","DOI":"10.1145\/3396474.3396479"},{"issue":"2","key":"2311_CR33","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0165-0114(95)00169-7","volume":"78","author":"M Inuiguchi","year":"1996","unstructured":"Inuiguchi, M., Sakawa, M.: Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test. Fuzzy Sets Syst. 78(2), 231\u2013241 (1996)","journal-title":"Fuzzy Sets Syst."},{"issue":"1","key":"2311_CR34","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.ejor.2014.05.004","volume":"239","author":"Z Juman","year":"2014","unstructured":"Juman, Z., Hoque, M.: A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies. Eur. J. Oper. Res. 239(1), 146\u2013156 (2014). https:\/\/doi.org\/10.1016\/j.ejor.2014.05.004","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"2311_CR35","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010. Math. Program. Comput. 3(2), 103\u2013163 (2011). https:\/\/doi.org\/10.1007\/s12532-011-0025-9","journal-title":"Math. Program. Comput."},{"issue":"1\u20132","key":"2311_CR36","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1504\/IJOR.2016.078463","volume":"27","author":"P Kumar","year":"2016","unstructured":"Kumar, P., Panda, G., Gupta, U.: An interval linear programming approach for portfolio selection model. Int. J. Oper. Res. 27(1\u20132), 149\u2013164 (2016). https:\/\/doi.org\/10.1504\/IJOR.2016.078463","journal-title":"Int. J. Oper. Res."},{"issue":"6","key":"2311_CR37","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1109\/TFUZZ.2002.805902","volume":"10","author":"KK Lai","year":"2002","unstructured":"Lai, K.K., Wang, S., Xu, J., Zhu, S., Fang, Y.: A class of linear interval programming problems and its application to portfolio selection. IEEE Trans. Fuzzy Syst. 10(6), 698\u2013704 (2002). https:\/\/doi.org\/10.1109\/TFUZZ.2002.805902","journal-title":"IEEE Trans. Fuzzy Syst."},{"issue":"2","key":"2311_CR38","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1287\/ijoc.2018.0838","volume":"31","author":"I Lee","year":"2019","unstructured":"Lee, I., Curry, S., Serban, N.: Solving large batches of linear programs. INFORMS J. Comput. 31(2), 302\u2013317 (2019). https:\/\/doi.org\/10.1287\/ijoc.2018.0838","journal-title":"INFORMS J. Comput."},{"key":"2311_CR39","doi-asserted-by":"publisher","unstructured":"Li, D.: Interval-valued matrix games. In: Linear Programming Models and Methods of Matrix Games with Payoffs of Triangular Fuzzy Numbers, pp. 3\u201363. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-48476-0","DOI":"10.1007\/978-3-662-48476-0"},{"issue":"4","key":"2311_CR40","doi-asserted-by":"publisher","first-page":"1287","DOI":"10.1007\/s11590-013-0654-1","volume":"8","author":"W Li","year":"2014","unstructured":"Li, W., Luo, J., Wang, Q., Li, Y.: Checking weak optimality of the solution to linear programming with interval right-hand side. Optim. Lett. 8(4), 1287\u20131299 (2014). https:\/\/doi.org\/10.1007\/s11590-013-0654-1","journal-title":"Optim. Lett."},{"issue":"2","key":"2311_CR41","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1016\/j.ejor.2009.01.013","volume":"200","author":"Y Li","year":"2010","unstructured":"Li, Y., Huang, G.H., Guo, P., Yang, Z., Nie, S.L.: A dual-interval vertex analysis method and its application to environmental decision making under uncertainty. Eur. J. Oper. Res. 200(2), 536\u2013550 (2010). https:\/\/doi.org\/10.1016\/j.ejor.2009.01.013","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"2311_CR42","doi-asserted-by":"publisher","first-page":"1697","DOI":"10.1016\/j.cie.2008.06.002","volume":"56","author":"ST Liu","year":"2009","unstructured":"Liu, S.T., Kao, C.: Matrix games with interval data. Comput. Ind. Eng. 56(4), 1697\u20131700 (2009). https:\/\/doi.org\/10.1016\/j.cie.2008.06.002","journal-title":"Comput. Ind. Eng."},{"key":"2311_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.apenergy.2021.117867","volume":"305","author":"Y Liu","year":"2022","unstructured":"Liu, Y., Huang, G., Chen, J., Zhang, X., Zheng, X., Zhai, M.: Development of an optimization-aided small modular reactor siting model: a case study of Saskatchewan, Canada. Appl. Energy 305, 117867 (2022). https:\/\/doi.org\/10.1016\/j.apenergy.2021.117867","journal-title":"Appl. Energy"},{"key":"2311_CR44","doi-asserted-by":"publisher","unstructured":"L\u00f6fberg, J.: Yalmip: a toolbox for modeling and optimization in matlab. In: Proceedings of the CACSD Conference. Taipei, Taiwan (2004). https:\/\/doi.org\/10.1109\/CACSD.2004.1393890","DOI":"10.1109\/CACSD.2004.1393890"},{"key":"2311_CR45","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2019.0941","author":"H Luo","year":"2020","unstructured":"Luo, H., Ding, X., Peng, J., Jiang, R., Li, D.: Complexity results and effective algorithms for worst-case linear optimization under uncertainties. INFORMS J. Comput. (2020). https:\/\/doi.org\/10.1287\/ijoc.2019.0941","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"2311_CR46","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BF00927913","volume":"5","author":"A Miele","year":"1970","unstructured":"Miele, A., Pritchard, R.E., Damoulakis, J.: Sequential gradient-restoration algorithm for optimal control problems. J. Optim. Theory Appl. 5(4), 235\u2013282 (1970). https:\/\/doi.org\/10.1007\/BF00927913","journal-title":"J. Optim. Theory Appl."},{"issue":"21","key":"2311_CR47","doi-asserted-by":"publisher","first-page":"11055","DOI":"10.1007\/s00500-018-3658-z","volume":"23","author":"M Mohammadi","year":"2019","unstructured":"Mohammadi, M., Gentili, M.: Bounds on the worst optimal value in interval linear programming. Soft. Comput. 23(21), 11055\u201311061 (2019). https:\/\/doi.org\/10.1007\/s00500-018-3658-z","journal-title":"Soft. Comput."},{"key":"2311_CR48","doi-asserted-by":"publisher","first-page":"105160","DOI":"10.1016\/j.cor.2020.105160","volume":"129","author":"M Mohammadi","year":"2021","unstructured":"Mohammadi, M., Gentili, M.: The outcome range problem in interval linear programming. Comput. Oper. Res. 129, 105160 (2021). https:\/\/doi.org\/10.1016\/j.cor.2020.105160","journal-title":"Comput. Oper. Res."},{"key":"2311_CR49","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/A:1018985914065","volume":"81","author":"F Mraz","year":"1998","unstructured":"Mraz, F.: Calculating the exact bounds of optimal values in LP with interval coefficients. Ann. Oper. Res. 81, 51\u201362 (1998). https:\/\/doi.org\/10.1023\/A:1018985914065","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"2311_CR50","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4), 1574\u20131609 (2009). https:\/\/doi.org\/10.1137\/070704277","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2311_CR51","doi-asserted-by":"publisher","first-page":"1922","DOI":"10.1214\/14-AOAS728","volume":"8","author":"M Nobles","year":"2014","unstructured":"Nobles, M., Serban, N., Swann, J.: Spatial accessibility of pediatric primary healthcare: measurement and inference. Ann. Appl. Stat. 8(4), 1922\u20131946 (2014). https:\/\/doi.org\/10.1214\/14-AOAS728","journal-title":"Ann. Appl. Stat."},{"issue":"2","key":"2311_CR52","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10957-019-01610-y","volume":"184","author":"J Novotn\u00e1","year":"2020","unstructured":"Novotn\u00e1, J., Hlad\u00edk, M., Masa\u0159\u00edk, T.: Duality gap in interval linear programming. J. Optim. Theory Appl. 184(2), 565\u2013580 (2020). https:\/\/doi.org\/10.1007\/s10957-019-01610-y","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"2311_CR53","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF01386090","volume":"6","author":"W Oettli","year":"1964","unstructured":"Oettli, W., Prager, W.: Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides. Numer. Math. 6(1), 405\u2013409 (1964). https:\/\/doi.org\/10.1007\/BF01386090","journal-title":"Numer. Math."},{"issue":"1\u20132","key":"2311_CR54","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s10107-014-0799-4","volume":"152","author":"J Peng","year":"2015","unstructured":"Peng, J., Zhu, T.: A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties. Math. Program. 152(1\u20132), 593\u2013614 (2015). https:\/\/doi.org\/10.1007\/s10107-014-0799-4","journal-title":"Math. Program."},{"key":"2311_CR55","unstructured":"Rohn, J.: Proofs to \u201cSolving interval linear systems\u201d. Freiburger Intervall-Berichte 84\/7, Albert-Ludwigs-Universit\u00e4t, Freiburg (1984)"},{"issue":"1","key":"2311_CR56","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0167-6377(93)90077-T","volume":"13","author":"J Rohn","year":"1993","unstructured":"Rohn, J.: Stability of the optimal basis of a linear program under uncertainty. Oper. Res. Lett. 13(1), 9\u201312 (1993). https:\/\/doi.org\/10.1016\/0167-6377(93)90077-T","journal-title":"Oper. Res. Lett."},{"key":"2311_CR57","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/0-387-32698-7_3","volume-title":"Linear Optimization Problems with Inexact Data","author":"J Rohn","year":"2006","unstructured":"Rohn, J.: Interval linear programming. In: Fiedler, M., et al. (eds.) Linear Optimization Problems with Inexact Data, pp. 79\u2013100. Springer, Berlin (2006). https:\/\/doi.org\/10.1007\/0-387-32698-7_3"},{"key":"2311_CR58","doi-asserted-by":"publisher","unstructured":"Rohn, J.: Solvability of systems of interval linear equations and inequalities. In: Linear Optimization Problems with Inexact Data, pp. 35\u201377. Springer (2006). https:\/\/doi.org\/10.1007\/0-387-32698-7_2","DOI":"10.1007\/0-387-32698-7_2"},{"key":"2311_CR59","unstructured":"Rohn, J.: A handbook of results on interval linear problems (2012). Technical Report 1163. Institute of Computer Science. Academy of Sciences of the Czech Republic. Prague. http:\/\/www.nsc.ru\/interval\/Library\/Surveys\/ILinProblems.pdf"},{"key":"2311_CR60","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2019.0913","author":"E Roos","year":"2020","unstructured":"Roos, E., den Hertog, D.: Reducing conservatism in robust optimization. INFORMS J. Comput. (2020). https:\/\/doi.org\/10.1287\/ijoc.2019.0913","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"2311_CR61","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF02110042","volume":"3","author":"S Sen","year":"1994","unstructured":"Sen, S., Doverspike, R.D., Cosares, S.: Network planning with random demand. Telecommun. Syst. 3(1), 11\u201330 (1994). https:\/\/doi.org\/10.1007\/BF02110042","journal-title":"Telecommun. Syst."},{"issue":"4","key":"2311_CR62","doi-asserted-by":"publisher","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. Glob. Optim. 2(4), 379\u2013410 (1992). https:\/\/doi.org\/10.1007\/BF00122429","journal-title":"J. Glob. Optim."},{"issue":"4","key":"2311_CR63","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1287\/ijoc.2018.0851","volume":"31","author":"A Sierra Altamiranda","year":"2019","unstructured":"Sierra Altamiranda, A., Charkhgard, H.: A new exact algorithm to optimize a linear function over the set of efficient solutions for biobjective mixed integer linear programs. INFORMS J. Comput. 31(4), 823\u2013840 (2019). https:\/\/doi.org\/10.1287\/ijoc.2018.0851","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"2311_CR64","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TEVC.2017.2712906","volume":"22","author":"A Sinha","year":"2017","unstructured":"Sinha, A., Malo, P., Deb, K.: A review on bilevel optimization: from classical to evolutionary approaches and applications. IEEE Trans. Evol. Comput. 22(2), 276\u2013295 (2017). https:\/\/doi.org\/10.1109\/TEVC.2017.2712906","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"2311_CR65","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1186\/s40068-014-0015-9","volume":"3","author":"W Sun","year":"2014","unstructured":"Sun, W., An, C., Li, G., Lv, Y.: Applications of inexact programming methods to waste management under uncertainty: current status and future directions. Environ. Syst. Res. 3(1), 15 (2014). https:\/\/doi.org\/10.1186\/s40068-014-0015-9","journal-title":"Environ. Syst. Res."},{"key":"2311_CR66","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.omega.2016.06.007","volume":"68","author":"F Xie","year":"2017","unstructured":"Xie, F., Butt, M., Li, Z., Zhu, L.: An upper bound on the minimal total cost of the transportation problem with varying demands and supplies. Omega 68, 105\u2013118 (2017). https:\/\/doi.org\/10.1016\/j.omega.2016.06.007","journal-title":"Omega"},{"issue":"1\u20134","key":"2311_CR67","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1013875600711","volume":"22","author":"Y Yamamoto","year":"2002","unstructured":"Yamamoto, Y.: Optimization over the efficient set: overview. J. Glob. Optim. 22(1\u20134), 285\u2013317 (2002). https:\/\/doi.org\/10.1023\/A:1013875600711","journal-title":"J. Glob. Optim."},{"issue":"3","key":"2311_CR68","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1016\/j.ejor.2017.10.037","volume":"270","author":"Y Zheng","year":"2018","unstructured":"Zheng, Y., Lee, I., Serban, N.: Regularized optimization with spatial coupling for robust decision making. Eur. J. Oper. Res. 270(3), 898\u2013906 (2018). https:\/\/doi.org\/10.1016\/j.ejor.2017.10.037","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-023-02311-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-023-02311-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-023-02311-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T18:10:12Z","timestamp":1700590212000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-023-02311-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,9]]},"references-count":68,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["2311"],"URL":"https:\/\/doi.org\/10.1007\/s10957-023-02311-3","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2023,11,9]]},"assertion":[{"value":"5 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}