Summary: In this paper, we propose an iterative algorithm for solving a class of minimax fractional programming problems. By introducing a new variable and utilizing an exponential variable transformation, the problem (MFP) is converted into problem (Q). Then using condensed method, the problem (Q) is converted into a series of convex programming problems (\~Q). Numerical results show the feasibility and efficiency of the proposed algorithm.