An improving procedure of the interior projective method for linear programming

Abstract We propose in this study, a practical modification of Karmarkar’s projective algorithm for linear programming problems. This modification leads to a considerable reduction of the cost and the number of iterations. This claim is confirmed by many interesting numerical experimentations.