Volume 6 • Issue 1 • PP: 62-73 • 2024
On Two New Algorithms for Solving Mixed Integer Linear Programming Problems and Their Applications
View PDF Abstract
The objective of this paper is to introduce two new algorithms for dealing with mixed integer linear programming problems, where the first method will be applied to get the efficient cut in the standard cutting plane procedure to obtain the same optimal solution. The second method will be applied with many special conditions to get the global solution instead of the local solution by using cutting-plane and other famous algorithms. On the other hand, we compare our results to the other obtained results by applying other algorithms.
Keywords
References
al-Zubaidi, D.Ali Khalil" (2000) the proposed method for solving linear programming problems", XIII scientific conference of the Iraqi society for Statistical Sciences, journal of statistical sciences page(348-334)
[2] Ahmed, Dr. Khalid Hussein" (2000) operations research foundations and principles", Ministry of higher education and scientific research Press, first edition.
[3] Salih, Dr. Bashir Mohammed, Saleh, Mohammed Wajid Mohammed" (2005) improvements of the balanced individual method", Al-Rafidain Journal of Computer Science and mathematics, Vol. (2), Issue (2), page (72-67).
[4] fatouhi, Noor Najm Abdallah," (2005) a hybrid method of cutting levels with the method of branching in questions of correct programming " master thesis, unpublished.
[5] ADAM, N. LETCHFORD AND ANDREA LODI, (2001) "PRIMAL CUTTING PLANE ALGORITHM REVISITED " LANCASTER LA 14 YW, V, K, PP.
[6] R. S. GRAFINKEL AND G. L. NEMHAUSER, (2003) "INTEGER PROGRAMMING", MATH3902 OPERATION RESEARCH II, CHAPTER 1, PP. (1-5).
[7] RALPH, E. GOMORY, (1973) "AN ALL-INTEGER PROGRAMMING ALGORITHM", RAND REPORT, R. M. 25797, NEW YORK CHAPTER 3, PP. (46-S66).
[8] Salkim, Harrey M., (1975) "Integer programming Addision – Wesley publishing Co., Inc., Reading, Mass chapter 2, pp. 34.
Cite This Article
Choose your preferred format