The authors consider the following generalized fractional program: \[ (P)\quad_{x\in X}\{_{1\leq i\leq p}\{\frac{f_ i(x)}{g_ i(x)}\}\}, \] where \(X\subset R^ n\) is nonempty, \(f_ i\), \(g_ i\) are real continuous functions on an open set \(\Omega \subset R^ n\) including the closure of X, and \(g_ i\) are positive on \(\Omega\). The authors propose an algorithm for solving Problem (P) based on partial linearization. This algorithm is shown to be equivalent to the generalized Dinkelbach algorithm.