A New Algorithms in Mixed Integer Programming Problems

Abstract

ABSTRACT In this paper we have studied two new algorithms for solving mixed IPP. In the 1st 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 2nd 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 Al-Zobaidyi algorithm.

Keywords

• integer programming problems
• mixed integer programming
• numerical results