Abstract
In this paper, a decomposition algorithm for solving block-angular linear programs which is based on the dual simplex method will be presented. It can be considered to be a dualisation ofMuller-Merbach's direct decomposition method orKaul's extension of the generalized upper bounding technique for linear programs combined with the relaxation principle formulated byGeoffrion and applied to block-angular programs byRosen.
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.
