{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:30:28Z","timestamp":1787337028791,"version":"build-2736575974"},"reference-count":12,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Matrix Anal. Appl."],"published-print":{"date-parts":[[2003,1]]},"abstract":"<jats:p>A system of linear interval equations is called solvable if each system of linear equations contained therein is solvable. In the main result of this paper it is proved that solvability of a general rectangular system of linear interval equations can be characterized in terms of nonnegative solvability of a finite number of systems of linear equations which, however, is exponential in matrix size; the problem is proved to be NP-hard. It is shown that three earlier published results are consequences of the main theorem, which is compared with its counterpart valid for linear interval inequalities that turn out to be much less difficult to solve.<\/jats:p>","DOI":"10.1137\/s0895479801398955","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"237-245","source":"Crossref","is-referenced-by-count":37,"title":["Solvability of Systems of Linear Interval Equations"],"prefix":"10.1137","volume":"25","author":[{"given":"Jiri","family":"Rohn","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","volume-title":"Introduction to interval computations","author":"Alefeld G\u00f6tz","year":"1983"},{"key":"R2","first-page":"1","volume":"124","author":"Farkas J.","year":"1902","journal-title":"J. Reine Angew. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0075-4102","issn-type":"print"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2793-7"},{"key":"R4","volume-title":"Interval methods for systems of equations","author":"Neumaier Arnold","year":"1990"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386090"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01213466"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02243426"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(89)90004-9"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1080\/03081089108818064"},{"key":"R10","unstructured":"Ji\u0159\u00edRohn, Cheap and tight bounds: the recent result by E. Hansen can be made more efficient, Proceedings of the International Conference on Numerical Analysis with Automatic Result Verification (Lafayette, LA, 1993), 1993, 13\u20132195i:65076"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1002\/zamm.19980781594"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1080\/03081089508818341"}],"container-title":["SIAM Journal on Matrix Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S0895479801398955","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:41:07Z","timestamp":1787334067000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S0895479801398955"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["10.1137\/S0895479801398955"],"URL":"https:\/\/doi.org\/10.1137\/s0895479801398955","relation":{},"ISSN":["0895-4798","1095-7162"],"issn-type":[{"value":"0895-4798","type":"print"},{"value":"1095-7162","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}