In this paper, we propose a new global optimization algorithm, which can better solve a class of linear fractional programming problems on a large scale. First, the original problem is equivalent to a nonlinear programming problem: It introduces p auxiliary variables. At the same time, p new nonlinear equality constraints are added to the original problem. By classifying the coefficient symbols of all linear functions in the objective function of the original problem, four sets are obtained, which are
I
i
+
,
I
i
−
,
J
i
+
and
J
i
−
. Combined with the multiplication rule of real number operation, the objective function and constraint conditions of the equivalent problem are linearized into a lower bound linear relaxation programming problem. Our lower bound determination method only needs
e
i
T
x
+
f
i
≠
0
, and there is no need to convert molecules to non-negative forms in advance for some special problems. A output-space branch and bound algorithm based on solving the linear programming problem is proposed and the convergence of the algorithm is proved. Finally, in order to illustrate the feasibility and effectiveness of the algorithm, we have done a series of numerical experiments, and show the advantages and disadvantages of our algorithm by the numerical results.
Ranking Function Application for Optimal Solution of Fractional programming problem
