Abstract
The primal simplex method has been computationally superior to primal-dual simplex and out-of-kilter methods for solving large-scale generalized network linear programs. In this paper, a new primal-dual simplex method is proposed that is well suited for capitalizing on the network structure. The algorithm employs a dynamically sized subbasis matrix to monotonically decrease the number of infeasible node constraints while simultaneously optimizing a dual program. Computational results indicate an implementation of this algorithm is efficient and faster than a state-of-the-art generalized network primal simplex code on many randomly generated benchmark problems.
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.
