Global algorithm for effectively solving min-max affine fractional programs

This article investigates solving the min-max affine fractional programming problem (MAFPP), which arises in systems science and engineering. For globally solving the MAFPP, based on the outer space branching search, we design a branch-relaxation-bound algorithm. In the algorithm, we firstly convert the MAFPP into an equivalent problem with linear fractional constraints by introducing some auxiliary parameter variables. Next, to determine and update the lower bound during the branching search process, we construct the linear relaxation problem of the equivalence problem by using a new relaxation technique. The global convergence of the presented algorithm is verified. Also, by analyzing the algorithmic complexity, we give a maximum estimate of iteration times of the presented algorithm. Finally, computational comparison results are reported to demonstrate the effectiveness and feasibility of the presented algorithm.