On the modifications of the affine scaling algorithm for linear programming

The most effective implementation of interior point methods for linear programming problems is given by the affine scaling algorithm. The effective implementation require more modifications of the original methods. The present paper shows a new approach to compute the projection on the scaling matrix of the linear programming problem. This approach has an advantageous property, that more modification follows from various pivot searching methods.