A Gradient Projection Method for Linear Programming

The karmarkar algorithm is one kind of ploynomial method of solving the linear programming,but it has the deteat that the fruit is not stable.Meanwhile,for the method is belonging to the inner point algorithm,the point get at the termination step is always approximately optimal.The gradient project method given in this paper can go throngh the inner part or the relative inner part of the boundary of area.It is also proved that the method will terminate at limit step in this paper.