{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T15:30:40Z","timestamp":1776785440779,"version":"3.51.2"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"21","license":[{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s00500-018-3658-z","type":"journal-article","created":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T16:24:47Z","timestamp":1543681487000},"page":"11055-11061","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Bounds on the worst optimal value in interval linear programming"],"prefix":"10.1007","volume":"23","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"}]}],"member":"297","published-online":{"date-parts":[[2018,12,1]]},"reference":[{"issue":"4","key":"3658_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s40819-015-0074-2","volume":"2","author":"M Allahdadi","year":"2016","unstructured":"Allahdadi M, Golestane AK (2016) Monte carlo simulation for computing the worst value of the objective function in the interval linear programming. Int J Appl Comput Math 2(4):509\u2013518","journal-title":"Int J Appl Comput Math"},{"key":"3658_CR2","doi-asserted-by":"crossref","unstructured":"Cerulli R, Ambrosio C\u00a0D\u2019, Gentili M (2017) 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","DOI":"10.1007\/978-3-319-67308-0_37"},{"issue":"1","key":"3658_CR3","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 (2017) Convex contractive interval linear programming for resources and environmental systems management. Stoch Environ Res Risk Assess 31(1):205\u2013224","journal-title":"Stoch Environ Res Risk Assess"},{"issue":"2","key":"3658_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1057\/palgrave.jors.2600891","volume":"51","author":"JW Chinneck","year":"2000","unstructured":"Chinneck JW, Ramadan K (2000) Linear programming with interval coefficients. J Oper Res Soc 51(2):209\u2013220","journal-title":"J Oper Res Soc"},{"key":"3658_CR5","doi-asserted-by":"crossref","unstructured":"D\u2019Ambrosio C, Gentili M, Cerulli R (2018) The optimal value range problem for the interval (immune) transportation problem. Under Revision for Omega","DOI":"10.1016\/j.omega.2019.04.002"},{"issue":"1","key":"3658_CR6","first-page":"41","volume":"12","author":"W Gerlach","year":"1981","unstructured":"Gerlach W (1981) Zur l\u00f6sung linearer ungleichungssysteme bei st\u00f6rimg der rechten seite und der koeffizientenmatrix. Optimization 12(1):41\u201343","journal-title":"Optimization"},{"issue":"3","key":"3658_CR7","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10700-009-9060-7","volume":"8","author":"M Hladik","year":"2009","unstructured":"Hladik M (2009) Optimal value range in interval linear programming. Fuzzy Optim Decis Mak 8(3):283\u2013294","journal-title":"Fuzzy Optim Decis Mak"},{"key":"3658_CR8","first-page":"85","volume-title":"Linear programming\u2013new frontiers in theory and applications, chap 2","author":"M Hladik","year":"2012","unstructured":"Hladik M (2012a) Interval linear programming: a survey. In: Mann ZA (ed) Linear programming\u2013new frontiers in theory and applications, chap 2. Nova Science, New York, pp 85\u2013120"},{"key":"3658_CR9","unstructured":"Hladik M (2012b) 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"},{"issue":"7","key":"3658_CR10","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1007\/s11590-013-0715-5","volume":"8","author":"M Hladik","year":"2014","unstructured":"Hladik M (2014) On approximation of the best case optimal value in interval linear programming. Optim Lett 8(7):1985\u20131997","journal-title":"Optim Lett"},{"issue":"3","key":"3658_CR11","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1137\/S1052623402416839","volume":"14","author":"C Jansson","year":"2004","unstructured":"Jansson C (2004) Rigorous lower and upper bounds in linear programming. SIAM J Optim 14(3):914\u2013935","journal-title":"SIAM J Optim"},{"issue":"1","key":"3658_CR12","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 (2014) 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","journal-title":"Eur J Oper Res"},{"issue":"6","key":"3658_CR13","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1109\/TFUZZ.2002.805902","volume":"10","author":"KK Lai","year":"2002","unstructured":"Lai KK, Wang SY, Xu JP, Zhu SS, Fang Y (2002) A class of linear interval programming problems and its application to portfolio selection. IEEE Trans Fuzzy Syst 10(6):698\u2013704","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"3658_CR14","unstructured":"Li DF (2016) Interval-valued matrix games. In: Linear programming models and methods of matrix games with payoffs of triangular fuzzy numbers. Springer, pp 3\u201363"},{"issue":"2","key":"3658_CR15","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1016\/j.ejor.2009.01.013","volume":"200","author":"YP Li","year":"2010","unstructured":"Li YP, Huang GH, Guo P, Yang ZF, Nie SL (2010) A dual-interval vertex analysis method and its application to environmental decision making under uncertainty. Eur J Oper Res 200(2):536\u2013550","journal-title":"Eur J Oper Res"},{"issue":"4","key":"3658_CR16","doi-asserted-by":"publisher","first-page":"1697","DOI":"10.1016\/j.cie.2008.06.002","volume":"56","author":"ST Liu","year":"2009","unstructured":"Liu ST, Kao C (2009) Matrix games with interval data. Comput Ind Eng 56(4):1697\u20131700","journal-title":"Comput Ind Eng"},{"key":"3658_CR17","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/A:1018985914065","volume":"81","author":"F Mraz","year":"1998","unstructured":"Mraz F (1998) Calculating the exact bounds of optimal valuesin lp with interval coefficients. Ann Oper Res 81:51\u201362","journal-title":"Ann Oper Res"},{"issue":"2","key":"3658_CR18","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1023\/A:1009997221089","volume":"5","author":"A Neumaier","year":"1999","unstructured":"Neumaier A (1999) A simple derivation of the Hansen\u2013Bliek\u2013Rohn\u2013Ning\u2013Kearfott enclosure for linear interval equations. Reliab Comput 5(2):131\u2013136","journal-title":"Reliab Comput"},{"issue":"1","key":"3658_CR19","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF01386090","volume":"6","author":"W Oettli","year":"1964","unstructured":"Oettli W, Prager W (1964) Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides. Numerische Mathematik 6(1):405\u2013409","journal-title":"Numerische Mathematik"},{"key":"3658_CR20","doi-asserted-by":"crossref","unstructured":"Rohn J (2006a) Interval linear programming. In: Linear optimization problems with inexact data. Springer, pp 79\u2013100","DOI":"10.1007\/0-387-32698-7_3"},{"key":"3658_CR21","doi-asserted-by":"crossref","unstructured":"Rohn J (2006b) Solvability of systems of interval linear equations and inequalities. In: Linear optimization problems with inexact data. Springer, pp 35\u201377","DOI":"10.1007\/0-387-32698-7_2"},{"key":"3658_CR22","doi-asserted-by":"crossref","unstructured":"Rump SM (1999) INTLAB\u2014INTerval LABoratory. In: Csendes T (ed) Developments in reliable computing, pp 77\u2013104. Kluwer Academic Publishers, Dordrecht. \n                    http:\/\/www.ti3.tuhh.de\/rump\/","DOI":"10.1007\/978-94-017-1247-7_7"},{"key":"3658_CR23","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 MM, Li Z, Zhu L (2017) An upper bound on the minimal total cost of the transportation problem with varying demands and supplies. Omega 68:105\u2013118","journal-title":"Omega"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3658-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-018-3658-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3658-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T08:02:03Z","timestamp":1575273723000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-018-3658-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,1]]},"references-count":23,"journal-issue":{"issue":"21","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["3658"],"URL":"https:\/\/doi.org\/10.1007\/s00500-018-3658-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,1]]},"assertion":[{"value":"1 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}},{"value":"This article does not contain any studies with human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}