Abstract
An interval linear program is (IP): maximize c tx s.t. b -⩽ Ax⩽ b +, where the matrix A, vectors c, b -, and b + are given. The explicit solution of (IP) when A has full row rank [2] is used here to derive an iterative method for solving the general (IP). This method applies to general linear programs and is shown to be a dual method with multiple substitution.
Sign-in/Register to access full text options 
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.
