On Some Connections Between Bicriteria and Fractional Programming Problems

The multiobjective fractional programming /MOFP/ problem is formulated and some theory is given. The special case of MOFP is scalar fractional programming /FP/ problem. Connections between FP problem and a special bicriteria programming problems are investigated. Some results of Geoffrion [2] are extended. Replacement of the bicriteria programming problem by the adequate one-parametric programming problem provides with some parametric procedure for FP problem. Basing upon these results we present another motivation for the parametric algorithm of solving the linear FP problem proposed earlier by Frankel, Novaes and Pollack [1].