Convexity in Linear Fractional Programming Problem

Linear programming is a mathematical programming technique to optimize performance under a set of resource constraints as specified by organization. Linear fractional programming is a generalization of linear programming. The objective functions in linear programs are linear functions while the objective function in a linear fractional program is a ratio of two linear functions. In his paper an attempt is made to solve the convexity in linear fractional programming problem by taking CCR model, which states that the collection of all feasible solution to CCR model constitutes a convex set whose extreme points correspond to the basic feasible solutions.