In this paper, we consider solving the pure integer program. Due to the characteristics of integer restric- tions it is really harder to solve order to solve ILP, there are many proposed methods, including cutting planes, polyhedral developments, hybrid algorithms, RLT, disjunctive programming, and post solution analysis