{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T07:04:06Z","timestamp":1774681446642,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T00:00:00Z","timestamp":1534464000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["P402\/13-10660S"],"award-info":[{"award-number":["P402\/13-10660S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007543","name":"Grantov\u00e1 Agentura, Univerzita Karlova","doi-asserted-by":"publisher","award":["156317"],"award-info":[{"award-number":["156317"]}],"id":[{"id":"10.13039\/100007543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s10589-018-0029-8","type":"journal-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T04:11:20Z","timestamp":1534479080000},"page":"269-292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["On the optimal solution set in interval linear programming"],"prefix":"10.1007","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3052-5970","authenticated-orcid":false,"given":"Elif","family":"Garajov\u00e1","sequence":"first","affiliation":[]},{"given":"Milan","family":"Hlad\u00edk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,17]]},"reference":[{"issue":"8","key":"29_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., Mishmast Nehi, H.: The optimal solution set of the interval linear programming problems. Optim. Lett. 7(8), 1893\u20131911 (2013)","journal-title":"Optim. Lett."},{"key":"29_CR2","volume-title":"Robust Optimization. Princeton Series in Applied Mathematics","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton Series in Applied Mathematics. Princeton University Press, Princeton (2009)"},{"issue":"2","key":"29_CR3","doi-asserted-by":"publisher","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."},{"issue":"6","key":"29_CR4","doi-asserted-by":"publisher","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."},{"key":"29_CR5","unstructured":"Garajov\u00e1, E.: The optimal solution set of interval linear programming problems. Master\u2019s thesis, Charles University, Prague (2016). \n                    http:\/\/is.cuni.cz\/webapps\/zzp\/detail\/168259\/?lang=en\n                    \n                  . Accessed 3 Oct 2016"},{"issue":"1","key":"29_CR6","first-page":"41","volume":"12","author":"W Gerlach","year":"1981","unstructured":"Gerlach, W.: Zur L\u00f6sung linearer Ungleichungssysteme bei St\u00f6rung der rechten Seite und der Koeffizientenmatrix. Math. Operationsforsch. Stat., Ser Optim. 12(1), 41\u201343 (1981)","journal-title":"Math. Operationsforsch. Stat., Ser Optim."},{"issue":"2","key":"29_CR7","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/0022-247X(85)90225-2","volume":"111","author":"JB Hiriart-Urruty","year":"1985","unstructured":"Hiriart-Urruty, J.B.: Images of connected sets by semicontinuous multifunctions. J. Math. Anal. Appl. 111(2), 407\u2013422 (1985)","journal-title":"J. Math. Anal. Appl."},{"key":"29_CR8","unstructured":"Hlad\u00edk, M.: Tolerances in portfolio selection via interval linear programming. In: Rehorova, P., Marsikova, K., Hubinka, Z. (eds.) Proceedings of 26th International Conferences on Mathematical Methods in Economics, Liberec, Czech Republic, pp. 185\u2013191. Technical University Liberec (2008)"},{"key":"29_CR9","unstructured":"Hlad\u00edk, M.: Interval linear programming: a survey. In: Z.A. Mann (ed.) Linear Programming\u2014New Frontiers in Theory and Applications, chap. 2, pp. 85\u2013120. Nova Science Publishers, New York (2012)"},{"key":"29_CR10","unstructured":"Hlad\u00edk, M.: An interval linear programming contractor. In: Ram\u00edk, J., Stav\u00e1rek, D. (eds.) Proceedings of 30th International Conference on Mathematical Methods in Economics, Karvin\u00e1, Czech Republic, pp. 284\u2013289 (Part I.). Silesian University in Opava, School of Business Administration in Karvin\u00e1 (2012)"},{"issue":"11","key":"29_CR11","doi-asserted-by":"publisher","first-page":"4156","DOI":"10.1016\/j.laa.2013.02.012","volume":"438","author":"M Hlad\u00edk","year":"2013","unstructured":"Hlad\u00edk, M.: Weak and strong solvability of interval linear systems of equations and inequalities. Linear Algebra Appl. 438(11), 4156\u20134165 (2013)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"29_CR12","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)","journal-title":"Optim. Lett."},{"issue":"7","key":"29_CR13","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)","journal-title":"Optim. Lett."},{"key":"29_CR14","first-page":"47","volume-title":"Interval Linear Programming Techniques in Constraint Programming and Global Optimization","author":"M Hlad\u00edk","year":"2014","unstructured":"Hlad\u00edk, M., Hor\u00e1\u010dek, J.: Interval Linear Programming Techniques in Constraint Programming and Global Optimization, pp. 47\u201359. Springer, Cham (2014)"},{"issue":"4","key":"29_CR15","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1080\/02630259208970657","volume":"9","author":"G Huang","year":"1992","unstructured":"Huang, G., Baetz, B.W., Patry, G.G.: A grey linear programming approach for municipal solid waste management planning under uncertainty. Civil Eng. Syst. 9(4), 319\u2013335 (1992)","journal-title":"Civil Eng. Syst."},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Jansson, C.: A self-validating method for solving linear programming problems with interval input data. In: Scientific Computation with Automatic Result Verification, pp. 33\u201345. Springer, Vienna (1988)","DOI":"10.1007\/978-3-7091-6957-5_4"},{"key":"29_CR17","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0024-3795(96)00681-7","volume":"251","author":"C Jansson","year":"1997","unstructured":"Jansson, C.: Calculation of exact bounds for the solution set of linear interval systems. Linear Algebra Appl. 251, 321\u2013340 (1997)","journal-title":"Linear Algebra Appl."},{"issue":"6","key":"29_CR18","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.Y., Xu, J.P., Zhu, S.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)","journal-title":"IEEE Trans. Fuzzy Syst."},{"issue":"4","key":"29_CR19","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s11590-014-0791-1","volume":"9","author":"W Li","year":"2015","unstructured":"Li, W.: A note on dependency between interval linear systems. Optim. Lett. 9(4), 795\u2013797 (2015)","journal-title":"Optim. Lett."},{"issue":"4","key":"29_CR20","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)","journal-title":"Comput. Ind. Eng."},{"issue":"6","key":"29_CR21","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1089\/ees.2007.0289","volume":"26","author":"Z Liu","year":"2009","unstructured":"Liu, Z., Huang, G., Nie, X., He, L.: Dual-interval linear programming model and its application to solid waste management planning. Environ. Eng. Sci. 26(6), 1033\u20131045 (2009)","journal-title":"Environ. Eng. Sci."},{"key":"29_CR22","unstructured":"Machost, B.: Numerische Behandlung des Simplexverfahrens mit intervallanalytischen Methoden. Tech. Rep. 30, Berichte der GMD, Bonn (1970)"},{"issue":"12","key":"29_CR23","doi-asserted-by":"publisher","first-page":"1462","DOI":"10.1287\/mnsc.28.12.1462","volume":"28","author":"PG McKeown","year":"1982","unstructured":"McKeown, P.G., Minch, R.A.: Multiplicative interval variation of objective function coefficients in linear programming. Manag. Sci. 28(12), 1462\u20131470 (1982)","journal-title":"Manag. Sci."},{"key":"29_CR24","unstructured":"Meyer, R.R.: Continuity properties of linear programs. Tech. rep., University of Wisconsin, Madison Department of Computer Sciences (1979)"},{"key":"29_CR25","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.cam.2015.07.034","volume":"292","author":"A Mostafaee","year":"2016","unstructured":"Mostafaee, A., Hlad\u00edk, M., \u010cern\u00fd, M.: Inverse linear programming with interval coefficients. J. Comput. Appl. Math. 292, 591\u2013608 (2016)","journal-title":"J. Comput. Appl. Math."},{"key":"29_CR26","volume-title":"Topology. Pearson Custom Library","author":"J Munkres","year":"2013","unstructured":"Munkres, J.: Topology. Pearson Custom Library. Pearson Education, Limited, Pearson (2013)"},{"issue":"1","key":"29_CR27","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. Numerische Mathematik 6(1), 405\u2013409 (1964)","journal-title":"Numerische Mathematik"},{"issue":"3","key":"29_CR28","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02307386","volume":"53","author":"J Rohn","year":"1994","unstructured":"Rohn, J.: Enclosing solutions of linear interval equations is NP-hard. Computing 53(3), 365\u2013368 (1994)","journal-title":"Computing"},{"issue":"3","key":"29_CR29","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1023\/A:1009987227018","volume":"3","author":"J Rohn","year":"1997","unstructured":"Rohn, J.: Complexity of some linear problems with interval data. Reliab. Comput. 3(3), 315\u2013323 (1997)","journal-title":"Reliab. Comput."},{"key":"29_CR30","doi-asserted-by":"crossref","unstructured":"Rohn, J.: Interval linear programming. In: Linear Optimization Problems with Inexact Data, pp. 79\u2013100. Springer, New York (2006)","DOI":"10.1007\/0-387-32698-7_3"},{"key":"29_CR31","doi-asserted-by":"crossref","unstructured":"Rohn, J.: Solvability of systems of interval linear equations and inequalities. In: Linear Optimization Problems with Inexact Data, pp. 35\u201377. Springer, New York (2006)","DOI":"10.1007\/0-387-32698-7_2"},{"key":"29_CR32","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BFb0121040","volume-title":"Mathematical Programming Essays in Honor of George B. Dantzig Part I","author":"RJB Wets","year":"1985","unstructured":"Wets, R.J.B.: On the continuity of the value of a linear program and of related polyhedral-valued multifunctions. In: Cottle, R.W. (ed.) Mathematical Programming Essays in Honor of George B. Dantzig Part I, pp. 14\u201329. Springer, Berlin (1985)"},{"issue":"4","key":"29_CR33","doi-asserted-by":"publisher","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-Motzkin elimination. Oper. Res. 66(4), 1086\u20131100 (2018). \n                    https:\/\/doi.org\/10.1287\/opre.2017.1714","journal-title":"Oper. Res."},{"issue":"2","key":"29_CR34","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.ejor.2008.12.019","volume":"199","author":"F Zhou","year":"2009","unstructured":"Zhou, F., Huang, G.H., Chen, G.X., Guo, H.C.: Enhanced-interval linear programming. Eur. J. Oper. Res. 199(2), 323\u2013333 (2009)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-018-0029-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0029-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0029-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T15:28:42Z","timestamp":1569338922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-018-0029-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,17]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["29"],"URL":"https:\/\/doi.org\/10.1007\/s10589-018-0029-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,17]]},"assertion":[{"value":"17 October 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}