A New Algorithm Transfer Multiple Constraints To One Constraint For Integer Linear Programming

In this paper, the author introduces the theory of cycylic group into integer linear programming (ILP) problem. Transfer the multiple constraints ILP problem into one dimension knapsack problem. It includes following three chapters.In chapter 1, author introduces the background of the ILP problem and the current algorithm at now. In chapter 2, propose the new algorithm for solving the ILP problem, and proves the cardinal problems of the new algorithm. In chapter 3, author makes mathematical check for concrete problems, proves the feasibility of new algorithm. And propose the modified method for new algorithm.