Goal Programming Approach to Linear Constrained Non-linear Fractional Programming Problem Based on Taylor’s Series

Abstract

There are many cases that a nonlinear fractional programming, generated as a result of
studying fractional stochastic programming, must be solved. Sometimes an approximate
solution may be sufficient enough to start a new process of calculations. To this end, in this
paper a new method is presented for finding the solution of the NLFPP involving a nonfactorized or factorized objective function and subject to homogenous or non-homogenous
constraints. To solve any NLFPP proposed approach easily converts the problem into a LPP
by using a Taylor series and after that LPP solve by GP with the help of Lingo. This method
is easy to solve goal programming problem. This is powerful method to get improved
solution. It reduces number of iterations and solves valuable time by skipping calculations of
net evaluation.