Abstract
Using the recently developed ABS algorithm for solving linear Diophantine equations we give a representation of the solutions of a system of m linear integer inequalities in n variables, m≤n, with full rank coefficient matrix. We apply this result to solve linear integer programming problems with m≤n inequalities