A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
AbstractIn this study, a novel alternative method based on parameterization for solving Integer Linear Programming (ILP) problems having three variables is developed. This method, which is better than the cutting plane and branch boundary method, can be applied to pure integer linear programming problems with m linear inequality constraints, a linear objective function with three variables. Both easy to understand and to apply, the method provides an effective tool for solving three variabledoi:10.2478/cait-2020-0045 fatcat:urcnikbz5fewdih6c5mzgaaxli