A neural network model for solving the convex programming problems is extended to solving the general nonconvex nonlinear programming problems in the paper. The theoretical analysis indicates that under suitable conditions the equilibrium point of the proposed neural network model for solving the nonconvex nonlinear programming problems is asymptotically stable and corresponds to the local optimal solution to the nonlinear programming problems.