  We determine the maximal gap between the optimal values of an integer program
and its linear programming relaxation, where the matrix and cost function are
fixed but the right hand side is unspecified. Our formula involves irreducible
decomposition of monomial ideals. The gap can be computed in polynomial time
when the dimension is fixed.
