Abstract

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