Abstract
Some duality results for integer programming based on subadditive functions are presented first for linear programs and then for the group problem. A similar result for the knapsack problem is given and then a relationship between facets for the group relaxation and facets of the knapsack problem is given. The mixed integer cyclic group problem is then considered and a dual problem given. A common theme is to try to characterize the strongest possible dual problem or equivalently the smallest possible cone of subadditive functions.
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.
