Linear fractional programming has been an important planning tool for the past four decades. The main contribution of this study is to show, under some assumptions, for a linear programming problem, that there are two different dual problems (one linear programming and one linear fractional functional programming) that are equivalent. In other words, we formulate a linear programming problem that is equivalent to the general linear fractional functional programming problem. These equivalent models have some interesting properties which help us to prove the related duality theorems in an easy manner. A traditional data envelopment analysis (DEA) model is taken, as an instance, to illustrate the applicability of the proposed approach.