TECHNOLOGY 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 o f linear programming. The objective functions in linear prog rams are linear functions while the objective funct ion in a linear fractional program is a ratio of two linear functio ns. In his paper an attempt is made to solve the co nvexity in linear fractional programming problem by taking CCR model, which states that the collection of all feasible s olution to CCR model constitutes a convex set whose extreme points correspond to the basic feasible solutions.