Abstract

Let IP denote the family of integer programs of the form Min cx : Ax = b, x ∈ N^n obtained by varying the right hand side vector b but keeping A and c fixed. A test set for IP is a set of vectors in Z^n such that for each non-optimal solution α to a program in this family, there is at least one element g in this set such that α - g has an improved cost value as compared to α. We describe a unique minimal test set for this family called the reduced Gröbner basis of IP. An algorithm for its construction is presented which we call a Geometric Buchberger Algorithm for integer programming. We show how an integer program may be solved using this test set and examine some geometric properties of elements in the set. The reduced Grobner basis is then compared with some other known test sets from the literature. We also indicate an easy procedure to construct test sets with respect to all cost functions for a matrix A ∈ Z^(n-2)×n of full row rank.

Citations

323	Gr"obner Bases: An algorithmic method in polynomial ideal theory - Buchberger - 1985
199	Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra, UTM - Cox, Little, et al. - 1992
183	Convex Bodies and Algebraic Geometry– An Introduction to the Theory of Toric Varieties - Oda
112	Theory of Linear and - Schrijver - 1986
40	Gröbner bases of toric varieties - Sturmfels
17	An Algebraic Geometry Algorithm for Scheduling in Presence of Setups and Correlated Demands - TAYUR, THOMAS, et al. - 1995
15	Neighborhood systems for production sets with indivisibilities - Scarf - 1986
5	Buchberger Algorithm and Integer - Conti, Traverso - 1991
5	Production sets with indivisibilities - Scarf - 1981
4	Some basis theorems for integral monoids - Jeroslow - 1978
1	On the Foundations of Linear and - Graver - 1975