Full Length Article
DOI: https://doi.org/10.54216/IJAACI.060106
On Two New Algorithms for Solving Mixed Integer Linear Programming Problems and Their Applications
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.
Taher Ahmed Jubbori
visibility
2364
download
3649