Computational experience in sensitivity analysis for nonlinear programming

A method for sensitivity analysis in nonlinear programming has recently been developed using the sequential unconstrained minimization technique. It is applied here to perform sensitivity analyses on four example problems to demonstrate the computational feasibility and characteristics of the approach. The sensitivity analysis is conducted along the minimizing trajectory for each problem. The convergence characteristics of the first partial derivatives of the variables and objective function with respect to the parameters in the sensitivity analysis are illustrated.