There are so many methods for the problem of integer programming (IP); however, available
methods connected with theoryofgroups are still given little consideration. This paper, in orderto predigest
the process of solving the IP problem, attempts to divide the IP problem into a series of simple models by
using the decomposing theoremof limited groups—significant both in theory and in practice. Based on the
translation and loosing operation of IP problem, the steps of transformation and decomposition to the group
programming model are discussed in detail, and solutions to two decomposition results are also discussed.