Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
