In this paper，a numerical example of linear fractional programming (LFP) has been constructed in which a finite sequence of degenerate bases obtained by the LFP's primal simplex algorithm in referenes [1] and [2] may yield basis cycling and hence no optimum solution could be got. So，We propose the finite algorithm using Bland's rule.