A direct iterative algorithm for linear programming

The algorithm combines a general linear programming (LP) problem with a hyper saddle surface and determines the optimal solution by searching the saddle point of the hyper saddle surface. Discussed the relation between the optimal solution of the non-standard LP problem and the saddle point of the hyper saddle surface, proposed the direct iterative algorithm for general LP problems.