Abstract: This paper presents an improved (infeasible) simplex method for linear programming,in which some of vertex points,corresponding to the iterative process,can be out of the feasible domain of (LP).The algorithm would performs the iterations no more than the simplex method and simultaneously,can overcome the iterative loop caused by degeneracy.

Key words: linear programming, feasible domain, exterior point, simplex method