تحسين خوارزمية كارماركار للحصول على الحل الأمثل

Abstract EN

In this paper we improve the Karmarkar's method for linear programming by using the vector of initial point with all iteration, and when 3(n 1) n − q = , we see that the Karmaker's method can be reduced to a direct method without iteration and grantee the optimal solution.

Finally the new method have been compared with Karmaker's.

The numerical results show that the new method is better and faster.