Abstract:
This paper discusses a new modified simplex method for solving a quadratic fractional
programming problems. The method based on linear programming problem
for finding an optimal solution to a quadratic fractional programming problem,
where the numerator of objective function can be factorized into two linear functions.
An illustration in the form of an example is given to better understand the
completion of the programming using modified simplex method