{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T14:20:59Z","timestamp":1761920459405,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T00:00:00Z","timestamp":1530144000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura C(esk\u00e9 Republiky","doi-asserted-by":"publisher","award":["17-13086S","18-04735S"],"award-info":[{"award-number":["17-13086S","18-04735S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura C(esk\u00e9 Republiky","doi-asserted-by":"publisher","award":["18-04735S"],"award-info":[{"award-number":["18-04735S"]}],"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":["Optim Lett"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s11590-018-1289-z","type":"journal-article","created":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T06:02:14Z","timestamp":1530165734000},"page":"875-890","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases"],"prefix":"10.1007","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1761-897X","authenticated-orcid":false,"given":"Miroslav","family":"Rada","sequence":"first","affiliation":[]},{"given":"Milan","family":"Hlad\u00edk","sequence":"additional","affiliation":[]},{"given":"Elif","family":"Garajov\u00e1","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,28]]},"reference":[{"issue":"8","key":"1289_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."},{"issue":"Suppl. C","key":"1289_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.eswa.2017.10.020","volume":"93","author":"HA Ashayerinasab","year":"2018","unstructured":"Ashayerinasab, H.A., Nehi, H.M., Allahdadi, M.: Solving the interval linear programming problem: a new algorithm for a general case. Expert Syst. Appl. 93(Suppl. C), 39\u201349 (2018)","journal-title":"Expert Syst. Appl."},{"issue":"1\u20133","key":"1289_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E Balas","year":"1998","unstructured":"Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discrete Appl. Math. 89(1\u20133), 3\u201344 (1998). \n                    https:\/\/doi.org\/10.1016\/S0166-218X(98)00136-X","journal-title":"Discrete Appl. Math."},{"key":"1289_CR4","unstructured":"Beeck, H.: Linear programming with inexact data. technical report TUM-ISU-7830, Technical University of Munich, Munich (1978)"},{"issue":"2","key":"1289_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1057\/palgrave.jors.2600891","volume":"51","author":"JW Chinneck","year":"2000","unstructured":"Chinneck, J.W., Ramadan, K.: Linear programming with interval coefficients. J. Oper. Res. Soc. 51(2), 209\u2013220 (2000)","journal-title":"J. Oper. Res. Soc."},{"issue":"8","key":"1289_CR6","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1057\/jors.2009.81","volume":"61","author":"V Gabrel","year":"2010","unstructured":"Gabrel, V., Murat, C.: Robustness and duality in linear programming. J. Oper. Res. Soc. 61(8), 1288\u20131296 (2010)","journal-title":"J. Oper. Res. Soc."},{"key":"1289_CR7","unstructured":"Garajov\u00e1, E., Hlad\u00edk, M., Rada, M.: Interval Linear Programming Under Transformations: Optimal Solutions and Optimal Value Range (2018). \n                    arXiv:1802.09872"},{"key":"1289_CR8","first-page":"85","volume-title":"Linear Programming-New Frontiers in Theory and Applications, Mathematics Research Developments","author":"M Hlad\u00edk","year":"2012","unstructured":"Hlad\u00edk, M.: Interval linear programming: a survey. In: Mann, Z.\u00c1. (ed.) Linear Programming-New Frontiers in Theory and Applications, Mathematics Research Developments, pp. 85\u2013120. Nova Science Publishers, Hauppauge (2012)"},{"issue":"11","key":"1289_CR9","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). \n                    https:\/\/doi.org\/10.1016\/j.laa.2013.02.012","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"1289_CR10","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":"3","key":"1289_CR11","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/j.ejor.2016.04.032","volume":"254","author":"M Hlad\u00edk","year":"2016","unstructured":"Hlad\u00edk, M.: Robust optimal solutions in interval linear programming with forall-exists quantifiers. Eur. J. Oper. Res. 254(3), 705\u2013714 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"1289_CR12","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1007\/s11590-016-1088-3","volume":"11","author":"M Hlad\u00edk","year":"2017","unstructured":"Hlad\u00edk, M.: On strong optimality of interval linear programming. Optim. Lett. 11(7), 1459\u20131468 (2017)","journal-title":"Optim. Lett."},{"issue":"2","key":"1289_CR13","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)","journal-title":"Linear Multilinear Algebra"},{"issue":"Suppl. 3","key":"1289_CR14","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1002\/zamm.200108115114","volume":"81","author":"J Kon\u00ed\u010dkov\u00e1","year":"2001","unstructured":"Kon\u00ed\u010dkov\u00e1, J.: Sufficient condition of basis stability of an interval linear programming problem. Z. Angew. Math. Mech. 81(Suppl. 3), 677\u2013678 (2001)","journal-title":"Z. Angew. Math. Mech."},{"key":"1289_CR15","unstructured":"Krawczyk, R.: Fehlerabsch\u00e4tzung bei linearer Optimierung. In: Nickel, K. (ed.) Interval Mathemantics: Proceedings of the International Symposium, Karlsruhe, West Germany, May 20\u201324, 1975, LNCS, vol.\u00a029, pp. 215\u2013222. Springer (1975)"},{"key":"1289_CR16","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.laa.2015.06.029","volume":"484","author":"H Li","year":"2015","unstructured":"Li, H.: Necessary and sufficient conditions for unified optimality of interval linear program in the general form. Linear Algebra Appl. 484, 154\u2013174 (2015)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"1289_CR17","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). \n                    https:\/\/doi.org\/10.1007\/s11590-014-0791-1","journal-title":"Optim. Lett."},{"issue":"1","key":"1289_CR18","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s11590-015-0856-9","volume":"10","author":"W Li","year":"2016","unstructured":"Li, W., Liu, P., Li, H.: Checking weak optimality of the solution to interval linear program in the general form. Optim. Lett. 10(1), 77\u201388 (2016). \n                    https:\/\/doi.org\/10.1007\/s11590-015-0856-9","journal-title":"Optim. Lett."},{"issue":"3","key":"1289_CR19","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1080\/10556788.2014.940948","volume":"30","author":"W Li","year":"2015","unstructured":"Li, W., Liu, X., Li, H.: Generalized solutions to interval linear programmes and related necessary and sufficient optimality conditions. Optim. Methods Softw. 30(3), 516\u2013530 (2015)","journal-title":"Optim. Methods Softw."},{"key":"1289_CR20","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.cam.2013.09.075","volume":"260","author":"J Luo","year":"2014","unstructured":"Luo, J., Li, W., Wang, Q.: Checking strong optimality of interval linear programming with inequality constraints and nonnegative constraints. J. Comput. Appl. Math. 260, 180\u2013190 (2014)","journal-title":"J. Comput. Appl. Math."},{"key":"1289_CR21","unstructured":"Machost, B.: Numerische Behandlung des Simplexverfahrens mit intervallanalytischen Methoden. Technical Report\u00a030, Berichte der Gesellschaft f\u00fcr Mathematik und Datenverarbeitung, 54 pages, Bonn (1970)"},{"key":"1289_CR22","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/A:1018985914065","volume":"81","author":"F Mr\u00e1z","year":"1998","unstructured":"Mr\u00e1z, F.: Calculating the exact bounds of optimal values in LP with interval coefficients. Ann. Oper. Res. 81, 51\u201362 (1998)","journal-title":"Ann. Oper. Res."},{"key":"1289_CR23","unstructured":"Novotn\u00e1, J., Hlad\u00edk, M., Masa\u0159\u00edk, T.: Duality gap in interval linear programming. In: Zadnik Stirn, L.\u00a0et al. (ed.) Proceedings of the 14th International Symposium on Operational Research SOR\u201917, pp. 501\u2013506. Slovenian Society Informatika, Ljubljana, Slovenia (2017)"},{"issue":"1","key":"1289_CR24","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)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"1289_CR25","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":"1289_CR26","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/0-387-32698-7_3","volume-title":"Linear Optimization Problems with Inexact Data, Chap.\u00a03","author":"J Rohn","year":"2006","unstructured":"Rohn, J.: Interval linear programming. In: Fiedler, M., et al. (eds.) Linear Optimization Problems with Inexact Data, Chap.\u00a03, pp. 79\u2013100. Springer, New York (2006)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1289-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-018-1289-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1289-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T18:30:36Z","timestamp":1569954636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-018-1289-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,28]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["1289"],"URL":"https:\/\/doi.org\/10.1007\/s11590-018-1289-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2018,6,28]]},"assertion":[{"value":"30 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}