استخدام خوارزمية طريقة تطوير مو لد قطع المستوي لإيجاد الحل العددي لمسائل البرمجة الكسرية

Abstract

There are many methods for solving Fractional Programming problems thatgetting the optimal solution of the problem where the values of variables arefractional numbers not integer numbers, But when there are conditions in theproblem that requires the result is optimal integer solution, that is the resultedvariables values was numerical integer, At that time we must turn to a method thatwe get from it the integer solution of the problem. That is the subject of theresearch where we will employ an algorithm of the method (Modify SurrogateCutting Plane to solve linear integer programming problems) to find integersolution of Fractional Programming problems that after getting a view at FractionalProgramming and Integer Programming.