In this paper, new iterative method is proposed based on parametrization for solving Integer Linear Programming (ILP) problems with
four variables and an algorithm is provided. Our method, which is better than the cutting plane method and branch and bound methods
in solving ILP problems with four variables, can be easily applied regardless of the number of constraints. In addition, in our method,
all alternative solutions are found and presented to the decision maker. A numerical example is solved by applying the proposed method.