Outer space branching search method for solving generalized affine fractional optimization problem

This paper proposes an outer space branching search method, which is used to globally solve the generalized affine fractional optimization problem (GAFOP). First, we will convert the GAFOP into an equivalent problem (EP). Next, we structure the linear relaxation problem (LRP) of the EP by using the linearization technique. By subsequently partitioning the initial outer space rectangle and successively solving a series of LRPs, the proposed algorithm globally converges to the optimum solution of the GAFOP. Finally, comparisons of numerical results are reported to show the superiority and the effectiveness of the presented algorithm.