Based on the linear and geometric-plane features of linear programming, a special matrix was defined together with a transferring operation. A directionally iterating and transferring model of simplex's basis-vertex was given. With the help of this model, a two-step Vertex Steepest Extreme Direction Transition iteration algorithm for linear programming problem was proposed. In addition, by this simplex locally regularized method, the degenerated vertexes' iteration transition can be changed into the non-degenerate vertexes' iteration transition, thus eliminating the negative effect of vertex degeneration on vertex iteration transition processes.