Abstract: This paper present a new variant of successive quadratic programming methods with inequality and equality constraint. In calculation process, this methods need only to solve a quadratic programming problem at each iteration. In certain conditions, the global and fast local convergence properties of this algorithm is proved, whose step size of unity is acceptable and whose Maratos effect is obviated.