Affiliation:
1. Department of Mathematical Engineering , Yildiz Technical University , Davutpasa , Istanbul , Turkey
Abstract
Abstract
In 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 variable integer linear programming problems. The method proposed here is not only easy to understand and apply, it is also highly reliable, and there are no computational difficulties faced by other methods used to solve the three-variable pure integer linear programming problem. Numerical examples are provided to demonstrate the ease, effectiveness and reliability of the proposed algorithm.
Reference14 articles.
1. 1. Alexander, S. Theory of Linear and Integer Programming. Part III-IV. New Jersey, John Wiley & Sons, Ltd., 1986.
2. 2. Joseph, A. Parametric Formulation of the General Integer Linear Programming Problem. – Computers & Operations Research, Vol. 22, 1995, No 3, pp. 883-892.10.1016/0305-0548(94)00077-L
3. 3. Pandian, P., M. Jayalakshmi. A New Approach for Solving a Class of Pure Integer Linear Programming Problems. – Journal of Advanced Engineering Technology, Vol. 3, 2012, pp. 248-251.
4. 4. Tsai, J. F., M. H. Lin, Y. C. Hu. Finding Multiple Solutions to General Integer Linear Programs. – European Journal of Operational Research, Vol. 184, 2008, No 2, pp. 802-809.10.1016/j.ejor.2006.11.024
5. 5. Mohamad, N. H., F. Said. Integer Linear Programming Approach to Scheduling Toll Booth Collectors Problem. – Indian Journal of Science and Technology, Vol. 6, 2013, No 5, pp. 4416-4421.10.17485/ijst/2013/v6i5.7
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献