摘要：In this study, a novel alternative method based on parameterization forsolving Integer Linear Programming (ILP) problems having three variables isdeveloped. This method, which is better than the cutting plane and branch boundarymethod, can be applied to pure integer linear programming problems with m linearinequality constraints, a linear objective function with three variables. Both easy tounderstand and to apply, the method provides an effective tool for solving threevariable integer linear programming problems. The method proposed here is not onlyeasy to understand and apply, it is also highly reliable, and there are nocomputational difficulties faced by other methods used to solve the three-variablepure integer linear programming problem. Numerical examples are provided todemonstrate the ease, effectiveness and reliability of the proposed algorithm.
关键词：Linear Integer Programming (LIP); linear Diophantine equations;optimal hyperplane; pure integer programming problems; optimal solution.
