Abstract
An algorithm is presented for the solution of nonlinear optimization problems involving locally differentiable functions with known analytical expressions. The algorithm is based on perturbation methods of system analysis and develops from a set of easy to implement procedures designed to detect and solve the activation and deactivation of constraints while selecting the steepest feasible trajectory and the largest step length. Numerical applications are presented to illustrate the performance of the algorithm.