Abstract
Eaves and Zangwill [2] have developed a very general theory of the convergence of cutting plane algorithms. This theory is applied to prove the convergence of Geoffrion's Generalized Benders Decomposition procedure (GBD) [5]. Using the insight provided by the general theory, GBD is then modified to permit the deletion of old constraints without upsetting the infinite convergence property. Finally, certain approximations of GBD are presented and the robustness of the convergence results is indicated.
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.
