الفهرس 
IntroductionOnly 14 pages are availabe for public view
 |  | from | 75 |  |  |
| | | from | 75 | | |
Abstract
This thesis treats a new algorithm for solving the general nonlinear programming problem. Nonlinear programming (NLP) is the most general class of optimization problems that occurs in a wide range in engineering, applied mathematics and many other applications. The most eficient and fast methods to solve this class of problems are the sequential quadratic programming and primal-dual interior-point methods.