خوارزميات جديدة في مسائل البرمجة الصحيحة المختلطة

الملخص EN

In his paper we have sudied wo new algorihms for solving mixed IPP.

In he 1s algorihm we have invesigaed a new shor echnique for searching o he efficient cu in he sandard cuing plane procedure o obain he same opimal soluion by using a number of es problems in his field.

In he 2nd new algorihm we have pu cerain numerical condiions o obain he global soluion insead of he local soluion by using cuing-plane and Al-Zobaidyi [1] algorihms.

Our numerical resuls indicae ha our new suggesions are efficien boh numerically and heoreically compared wih Al-Zobaidyi algori-hm.