Abstract
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.
Similar content being viewed by others
References
R.L. Armacost and W.C. Mylander, “A guide to a SUMT-Version 4 computer subroutine for implementing sensitivity analysis in nonlinear programming”, Tech. Paper Serial T-287, The Institute for Management Science and Engineering, The George Washington University, Washington, D.C. (1973).
B. Causey, “A method for sensitivity analysis nonlinear programming”, Unpublished manuscript (1970).
A.R. Colville, “A comparative study of nonlinear programming codes”, IBM Tech. Rept. 320-2947 (1968).
A.V. Fiacco and G.P. McCormick,Nonlinear programming: Sequential unconstrained minimization techniques (Wiley, New York, 1968).
A.V. Fiacco, “Sensitivity analysis for nonlinear programming using penalty methods”, Tech. Paper Serial T-275, The Institute for Management Science and Engineering, The George Washington University, Washington, D.C. (1973).
A.V. Fiacco and G.P. McCormick, “Computational algorithm for the sequential unconstrained minimization technique for nonlinear programming”,Management Science 10 (1964) 601–617.
G.P. McCormick, “Penalty function versus non-penalty function methods for constrained nonlinear programming problems”,Mathematical Programming 1 (1971) 217–238.
W.C. Mylander, “Estimating the sensitivity of a solution of a nonlinear program”, Unpublished manuscript (1971).
W.C. Mylander, R.L. Holmes and G.P. McCormick; “A guide to SUMT-Version 4: The computer program implementing the sequential unconstrained minimization technique for nonlinear programming”, RAC-P-63, Research Analysis Corporation (1971).
C. van de Panne and W. Popp, “Minimum-cost cattle feed under probabilistic protein constraints”,Management Science 9 (1963) 405–430.
Author information
Authors and Affiliations
Additional information
Supported by contract N00014-67-A-0214, Task 0001, Project NR 347 020, Office of Naval Research.
Rights and permissions
About this article
Cite this article
Armacost, R.L., Fiacco, A.V. Computational experience in sensitivity analysis for nonlinear programming. Mathematical Programming 6, 301–326 (1974). https://doi.org/10.1007/BF01580247
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01580247