Abstract
Recent developments in interior point solution techniques of linear programming diverted attention from the simplex method. Performance of the simplex method in various environments is well documented. Some variants of the simplex method, however, have not been fully investigated for their efficiency. This paper focuses on one such method: the steepest-edge simplex algorithm. New computational evidence reported here raises the possibility that the steepest-edge algorithm might be more efficient than previously believed and therefore deserves more attention from researchers.
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.
