Abstract
AbstractA variant of the revised simplex method is given for solving capacitated network flow problems with additional linear constraints. The mathematical development, computer implementation and computational experience are presented. The algorithm described uses a working basis of size equal to the number of additional linear constraints for pivoting, pricing, and inversion, which for large networks, can result in a substantial reduction of computation over a standard linear programming approach.
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.
