Abstract
This paper focuses on solving systems of interval linear equations and interval linear programming in a computationally efficient way. Since the computational complexity of most interval enclosure numerical methods is often prohibitive, a procedure to obtain a relaxation of the interval enclosure solution that is computationally tractable is proposed. We show that our approach unifies the four standard interval solutions—the weak, strong, control and tolerance solutions. The interval linear system methods require $$n\cdot 2^{n}$$ linear solutions. However, in the case of linear programming problems, we show that this requires just two optimization problem of the size of the problem itself. Numerical examples illustrate our results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.