Abstract
This paper considers the effect of round-off errors on the computations carried out in the simplex method of linear programming. Standard implementations are shown to be subject to computational instabilities. An alternative implementation of the simplex method based upon L U decompositions of the basic matrices is presented, and its computational stability is indicated by a round-off error analysis. Some computational results are given.
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.
