Abstract: A kind of improved simplex method for searching solutions to linear programming is presented,that is, for the condition restriction Ax=b, a viable solution for initial radix can be directly obtained by circumvolve operation without introducing artificial variable. And then an optimization solution is got using traditional simplex method. A criterion about existence of the feasible solution and several examples of the algorithm are presented in this paper.