Abstract
This paper deals with methods for solving linear programming models with a primal or dual block-angular structure. A more general exposition of these methods can be found in [1]. For a primal block- angular structure the method is called the dual basis decomposition method.
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.
