The general nonlinear programming with linear constraints was investigated. In the algorithm, the method of contributing set was used. Comparing with the general contributing set method, the descending dimension method was used to solve the sub-problem with equality constraints in iterative procedure and the problem with inequality constraints. The algorithm is effective by the numerical test. Finally, it was proved that the iteration points are descending, when the objective functions are convex.