Iteration Methods for Solving Nonlinear Programming Problems

Abstract

This paper proposes simple and practical iteration methods for finding an optimal solution of a nonlinear programming problem with inequality and equality constraints. The iteration methods seek a point which satisfies the Kuhn-Tucker conditions. It is shown that the sequence of points generated by the iteraion methods converges to the optimal solution. Numerical results show the efficency of the proposed methods.