An algorithm for ranking the extreme points for a linear fractional Objective function

Abstract

An algorithm for ranking tbe extreme points of a convex , polyhedron in the decreasing order of the value of a linear fractional objective function at these points is given. The algorithm extends  algorithm given by Murty for the case of a linear objective function and utilises the criterion given by Kanti Swarup for the optimality of a basic feasbile solution for a linearfre actional programming problem.