Open AccessA New Algorithms in Mixed Integer Programming Problems
Author(s) -
Abbas Al-Bayati,
Basim A. Hassan
Publication year - 2010
Publication title -
maǧallaẗ al-rāfidayn li-ʿulūm al-ḥāsibāt wa-al-riyāḍiyyāẗ/al-rafidain journal for computer sciences and mathematics
Language(s) - English
Resource type - Journals
eISSN - 2311-7990
pISSN - 1815-4816
DOI - 10.33899/csmj.2010.163894
Subject(s) - cutting plane method , algorithm , integer programming , field (mathematics) , plane (geometry) , computer science , integer (computer science) , mathematical optimization , mathematics , geometry , programming language , pure mathematics
In this paper we have studied two new algorithms for solving mixed IPP. In the 1 algorithm we have investigated a new short technique for searching to the efficient cut in the standard cutting plane procedure to obtain the same optimal solution by using a number of test problems in this field. In the 2 new algorithm we have put certain numerical conditions to obtain the global solution instead of the local solution by using cutting-plane and Al-Zobaidyi [1] algorithms. Our numerical results indicate that our new suggestions are efficient both numerically and theoretically compared with AlZobaidyi algorithm.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom