Abstract

Abstract : The report analyzes the behavior of the round-off errors associated with three different computer implementations of the simplex method of linear programming. One of the three is representative of computer implementations in common use, and it is shown that the standard method of updating the basic- matrix inverse is numerically unstable. The remaining two implementations are suggested by the author and use triangular decompositions of the basic matrix as substitutes for its inverse. The implementations are shown to be stable, and one of them is shown to be competitive in speed with the standard simplex-method computer implementations. Error bounds which may be calculated from intermediate results are developed for each of the three implementations, and their use during computation for error monitoring and control is discussed.

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 call

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.