Abstract
A finite all integer method is proposed for solving a class of integer convex programming problems in which the problem functions are convex polynomials with rational coefficients. A small numerical example is also given to illustrate the algorithm.