Abstract
Two approaches to duality in integer programming are briefly reviewed in this paper with emphasis on their applicability. We introduce the so called integer Lagrangean relaxation for a given problem and show how it can be used in a construction of an appropriate dual problem for which strong duality holds. A branch-and-bound algorithm for solving both primal and dual problems is described. Finally we stress the importance of a reformulation of a given integer problem in seeking its optimal dual variables and their interpretation.
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.
