Abstract
In the first part of this paper we discuss the positive sum property, a property inherent to LP, IP, and MIP Graver test sets, and develop, based on that property, a common notational and algorithmic framework for Graver test sets. Moreover, we show how to find an initial feasible solution with the help of universal test sets and deal with termination of the augmentation algorithm that improves this solution to optimality.
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.
