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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: April 30, 2001 / Accepted: May 2002 Published online: March 28, 2003
Rights and permissions
About this article
Cite this article
Hemmecke, R. On the positive sum property and the computation of Graver test sets. Math. Program., Ser. B 96, 247–269 (2003). https://doi.org/10.1007/s10107-003-0385-7
Issue Date:
DOI: https://doi.org/10.1007/s10107-003-0385-7