{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T19:25:42Z","timestamp":1773170742744,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2012,8,7]],"date-time":"2012-08-07T00:00:00Z","timestamp":1344297600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s11590-012-0530-4","type":"journal-article","created":{"date-parts":[[2012,8,6]],"date-time":"2012-08-06T10:44:09Z","timestamp":1344249849000},"page":"1893-1911","source":"Crossref","is-referenced-by-count":64,"title":["The optimal solution set of the interval linear programming problems"],"prefix":"10.1007","volume":"7","author":[{"given":"M.","family":"Allahdadi","sequence":"first","affiliation":[]},{"given":"H.","family":"Mishmast Nehi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,8,7]]},"reference":[{"key":"530_CR1","volume-title":"Introduction to interval computations","author":"G. Alefeld","year":"1983","unstructured":"Alefeld G., Herzberger J.: Introduction to interval computations. Academic Press, Orlando, FL (1983)"},{"key":"530_CR2","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1057\/palgrave.jors.2600891","volume":"51","author":"JW. Chinneck","year":"2002","unstructured":"Chinneck JW., Ramadan K.: Linear programming with interval coefficient. J. Oper. Res. Soc. 51, 209\u2013220 (2002)","journal-title":"J. Oper. Res. Soc."},{"key":"530_CR3","volume-title":"Linear optimization problems with inexact data","author":"M. Fiedler","year":"2003","unstructured":"Fiedler M., Nedoma J., Ramik J., Zimmermann K.: Linear optimization problems with inexact data. Springer, Berlin (2003)"},{"key":"530_CR4","volume-title":"Global optimization using interval analysis, second edition, revised and expanded","author":"E. Hansen","year":"2004","unstructured":"Hansen E., Walster G.W.: Global optimization using interval analysis, second edition, revised and expanded. Marcel Dekker, New York (2004)"},{"key":"530_CR5","unstructured":"Hladik M.: How to determine basis stability in interval linear programming. Technical report KAM-DIMATIA Series (2010-973), Department of Applied Mathematics, Charles University, Prague (2010)"},{"key":"530_CR6","volume-title":"Linear Programming\u2013New Frontiers in Theory and Applications.","author":"M. Hladik","year":"2011","unstructured":"Hladik M.: Interval linear programming: A survey. In: Mann, Z.A. (ed.) Linear Programming\u2013New Frontiers in Theory and Applications., Nova Science publishers, New York (2011)"},{"issue":"Suppl.3","key":"530_CR7","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1002\/zamm.200108115114","volume":"81","author":"J. Konickova","year":"2001","unstructured":"Konickova J.: Sufficient condition of basis stability of an interval linear programming problem. ZAMM, Z. Angew. Math. Mech. 81(Suppl.3), 677\u2013678 (2001)","journal-title":"ZAMM, Z. Angew. Math. Mech."},{"issue":"2","key":"530_CR8","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1137\/S0895479896310743","volume":"20","author":"J. Rex","year":"1998","unstructured":"Rex J., Rohn J.: sufficient conditions for regularity and singularity of interval matrices. SIAM J. Matrix Anal. Appl. 20(2), 437\u2013445 (1998)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"530_CR9","first-page":"13","volume":"1993","author":"J. Rohn","year":"1993","unstructured":"Rohn J.: Cheap and tight bound: The recent result by E. Hansen can be made more efficient. Interval comput. 1993(4), 13\u201321 (1993)","journal-title":"Interval comput."},{"key":"530_CR10","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0165-0114(94)90097-3","volume":"66","author":"T. Shaocheng","year":"1994","unstructured":"Shaocheng T.: Interval number and fuzzy number linear programming. Fuzzy Sets Syst. 66, 301\u2013306 (1994)","journal-title":"Fuzzy Sets Syst."},{"key":"530_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00934831","volume":"12","author":"N.F. Stewart","year":"1973","unstructured":"Stewart N.F.: Interval arithmetic for guaranteed bounds in linear programming. J. Optim. Theory Appl. 12, 1\u20135 (1973)","journal-title":"J. Optim. Theory Appl."},{"key":"530_CR12","doi-asserted-by":"crossref","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., Guo H.: Enhanced-interval linear programming. Eur. J. Oper. Res. 199, 323\u2013333 (2009)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0530-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-012-0530-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0530-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:33Z","timestamp":1559409093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-012-0530-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,7]]},"references-count":12,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["530"],"URL":"https:\/\/doi.org\/10.1007\/s11590-012-0530-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,7]]}}}