Modification of Karmarkar’s projective scaling algorithm

This paper presents a new conversion technique of the standard linear programming problem into a homogenous form desired for the Karmarkar’s algorithm, where we employed the primal–dual method. The new converted linear programming problem provides initial basic feasible solution, simplex structure, and homogenous matrix. Apart from the transformation, Hooker’s method of projected direction is employed in the Karmarkar’s algorithm and the modified algorithm is presented. The modified algorithm has a faster convergence with a suitable choice of step size.