A Computer Technique for Solving Quadratic Fractional Programming Problems

Abstract

The main purpose of this paper is concerned with the generalization of simplex method for solving quadratic fractional programming problems by replacing one basic variable at an iteration of simplex method. We also develop an algorithm and a computer technique for solving quadratic fractional programming problem (QFP) involving the ratio of two indefinite quadratic special type (factorized) functions. For developing the technique, we use programming language MATHEMATICA. We also illustrate a numerical example to demonstrate our technique.