Abstract
A new algorithm is described in [1] to prevent looping in the simplex method of linear programming. This paper gives a proof of the basic theorem mentioned in [1]. It then describes the changes necessary to use condensed tables. It concludes by formulating a corresponding algorithm for the dual simplex method. Definitions and notation are the same as in [I], We shall reproduce some of them (except for equivalence).
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 callMore From: USSR Computational Mathematics and Mathematical Physics
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.
