Parametric Integer Programming in Fixed Dimension

Parametric integer programming deals with a family of integer programs that is defined by the same constraint matrix but where the right-hand sides are points of a given polyhedron. The question is whether all these integer programs are feasible. Kannan showed that this can be checked in polynomial time if the number of variables in the integer programs is fixed and the polyhedron of right-hand sides has fixed affine dimension. In this paper, we extend this result by providing a polynomial algorithm for this problem under the only assumption that the number of variables in the integer programs is fixed. We apply this result to deduce a polynomial algorithm to compute the maximum gap between the optimum values of an integer program in fixed dimension and its linear programming relaxation, as the right-hand side is varying over all vectors for which the integer program is feasible.

[1]  L. Lovász,et al.  Covering minima and lattice-point-free convex bodies , 1988 .

[2]  Alexander I. Barvinok,et al.  A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[3]  Ravi Kannan,et al.  Lattice translates of a polytope and the Frobenius problem , 1992, Comb..

[4]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[5]  A. Barvinok,et al.  An Algorithmic Theory of Lattice Points in Polyhedra , 1999 .

[6]  Celia Wrathall,et al.  Complete Sets and the Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[7]  Bernd Sturmfels,et al.  Computing the integer programming gap , 2007, Comb..

[8]  Herbert E. Scarf.  An observation on the structure of production sets with indivisibilities , 1977 .

[9]  A. Barvinok,et al.  Short rational generating functions for lattice point problems , 2002, math/0211146.

[10]  Herbert E. Scarf,et al.  Test sets for integer programs , 1997, Math. Program..

[11]  David G. Larman,et al.  The vertices of the knapsack polytope , 1983, Discret. Appl. Math..

[12]  Alexander E. Litvak,et al.  The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces , 1999, Math. Oper. Res..

[13]  Reznick,et al.  An Introduction to Empty Lattice-simplices , 1999 .

[14]  A. Barvinok.  A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed , 1994 .

[15]  William J. Cook,et al.  On integer points in polyhedra , 1992, Comb..

[16]  Mark Evan Hartmann,et al.  Cutting planes and the complexity of the integer hull , 1989 .

[17]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[18]  László Lovász,et al.  On integer points in polyhedra: A lower bound , 1992, Comb..

[19]  Ravi Kannan,et al.  Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix , 1979, SIAM J. Comput..

[20]  Vincent Loechner,et al.  Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions , 2007, Algorithmica.

[21]  Ravi Kannan.  Test Sets for Integer Programs, 0_ Sentences , 1990, Polyhedral Combinatorics.

[22]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[23]  David E. Bell.  A Theorem Concerning the Integer Lattice , 1977 .

[24]  Jean-Michel Kantor.  On the Width of Lattice-Free simplices , 1997 .

[25]  András Sebö,et al.  An Introduction to Empty Lattice Simplices , 1999, IPCO.

[26]  Matthias Köppe,et al.  Computing Parametric Rational Generating Functions with a Primal Barvinok Algorithm , 2008, Electron. J. Comb..

[27]  Robert Weismantel,et al.  Test sets of integer programs , 1998, Math. Methods Oper. Res..

[28]  László Lovász,et al.  Covering Minima and Lattice Point Free Convex Bodies , 1986, FSTTCS.

[29]  H. P. Williams.  THEORY OF LINEAR AND INTEGER PROGRAMMING (Wiley-Interscience Series in Discrete Mathematics and Optimization) , 1989 .

[30]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[31]  L. Lovász,et al.  A POLYNOMIAL-TIME TEST FOR TOTAL DUAL INTEGRALITY IN FIXED DIMENSION , 1984 .