Gomory integer programs

Abstract. The set of all group relaxations of an integer program contains certain special members called Gomory relaxations. A family of integer programs with a fixed coefficient matrix and cost vector but varying right hand sides is a Gomory family if every program in the family can be solved by one of its Gomory relaxations. In this paper, we characterize Gomory families. Every TDI system gives a Gomory family, and we construct Gomory families from matrices whose columns form a Hilbert basis for the cone they generate. The existence of Gomory families is related to the Hilbert covering problems that arose from the conjectures of Sebö. Connections to commutative algebra are outlined at the end.

[1]  Bernd Sturmfels,et al.  Constructions and complexity of secondary polytopes , 1990 .

[2]  Bernd Sturmfels,et al.  Gröbner bases of lattices, corner polyhedra, and integer programming. , 1995 .

[3]  Rekha R. Thomas.  A Geometric Buchberger Algorithm for Integer Programming , 1995, Math. Oper. Res..

[4]  Monomial IdealsSerkan Ho.  Monomial Ideals , 2001 .

[5]  DepartmentGeorge Mason UniversityFairfax.  Standard Pairs and Group Relaxations in Integer Programming , 1998 .

[6]  L. Wolsey.  Extensions of the Group Theoretic Approach in Integer Programming , 1971 .

[7]  R E Gomory,et al.  ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS. , 1965, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[9]  Richard P. Stanley,et al.  Linear diophantine equations and local cohomology , 1982 .

[10]  Rekha R. Thomas,et al.  Variation of cost functions in integer programming , 1997, Math. Program..

[11]  Winfried Bruns,et al.  Normality and covering properties of affine semigroups , 1999 .

[12]  Rekha R. Thomas,et al.  Standard pairs and group relaxations in integer programming , 1999 .

[13]  Günter M. Ziegler,et al.  Hilbert Bases, Unimodular Triangulations, and Binary Covers of Rational Polyhedral Cones , 1999, Discret. Comput. Geom..

[14]  András Sebö,et al.  Hilbert Bases, Caratheodory's Theorem and Combinatorial Optimization , 1990, IPCO.

[15]  Alexander Martin,et al.  A counterexample to an integer analogue of Carathéodory's theorem , 1999 .

[16]  Birkett Huber.  Computing gröbner fans of toric ideals , 2000, SIGS.

[17]  David A. Cox,et al.  Ideals, Varieties, and Algorithms , 1997 .

[18]  Rekha R. Thomas,et al.  The associated primes of initial ideals of lattice ideals , 1999 .

[19]  B. Sturmfels.  Gröbner bases and convex polytopes , 1995 .