Sensitivity Analysis and Real-Time Optimization of Parametric Nonlinear Programming Problems

  • Christof Büskens
  • Helmut Maurer


Basic results for sensitivity analysis of parametric nonlinear programming problems [11] are revisited. Emphasis is placed on those conditions that ensure the differentiability of the optimal solution vector with respect to the parameters involved in the problem. We study the explicit formulae for the sensitivity derivatives of the solution vector and the associated Lagrange multipliers. Conceptually, these formulae are tailored to solution algorithm calculations. However, we indicate numerical obstacles that prevent these expressions from being a direct byproduct of current solution algorithms. We investigate post-optimal evaluations of sensitivity differentials and discuss their numerical implementation. The main purpose of this paper is to describe an important application of sensitivity analysis: the development of real-time approximations of the perturbed solutions using Taylor expansions. Two elementary examples illustrate the basic ideas.


Sensitivity Differential Order Taylor Expansion Sensitivity Derivative Sensitivity Domain Second Order Sufficient Condition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R. L. Armacost, A. V. Fiacco: Computational Experience in Sensitivity Analysis for Nonlinear Programming. Mathematical Programming 6 (1974) 301–326MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    R. L. Armacost, W. C. Mylander: A Guide to the SUMT-Version 4 Computer Subrou-tine for Implementing Sensitivity Analysis in Nonlinear Programming. Technical report T-287, Institute for Management Sciences and Engineering, George Washington University, Washington, D.C., (1973)Google Scholar
  3. 3.
    T. J. Beltracchi, G. A. Gabriele: A RQP Based Method for Estimating Parameter Sensi-tivity Derivatives. Advances in Design Automation, ASME DE 14 (1988) 155–164Google Scholar
  4. 4.
    T. J. Beltracchi, G. A. Gabriele: Observations on Extrapolations Using Parameter Sensi-tivity Derivatives. Advances in Design Automation, ASME DE 14 (1988) 165–174Google Scholar
  5. 5.
    T. J. Beltracchi, G. A. Gabriele: An Investigation of New Methods for Estimating Para-meter Sensitivity Derivatives. NASA Contractor Report 4245, Langley Research Center, USA (1989) 1–130Google Scholar
  6. 6.
    C. Büskens: Optimierungsmethoden und Sensitivitätsanalyse für optimale Steuerprozesse mit Steuer- und Zustands- Beschränkungen, Dissertation, Institut für Numerische Mathematik, Universität Münster, Münster, Germany, (1998)Google Scholar
  7. 7.
    C. Büskens: Real-Time Solutions for Perturbed Optimal Problems by a Mixed Open- and Closed- Loop Strategy. This volume.Google Scholar
  8. 8.
    C. Büskens, H. Maurer: Sensitivity Analysis and Real-Time Control of Parametric Opti-mal Control Problems Using Nonlinear Programming Methods. This volume.Google Scholar
  9. 9.
    C. Büskens, H. Maurer: Real-Time Control of an Industrial Robot. This volume.Google Scholar
  10. 10.
    A. V. Fiacco: Sensitivity Analysis for Nonlinear Programming Using Penalty Methods. Mathematical Programming 10, (1976) 287–311MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    A. V. Fiacco: Introduction to Sensitivity and Stability Analysis in Nonlinear Programming. Mathematics in Science and Engineering 165, Academic Press, New York, (1983)Google Scholar
  12. 12.
    R. Fletcher: Practical Methods of Optimization. 2nd ed., J. Wiley & Sons, Chichester/New York4, (1997)Google Scholar
  13. 13.
    P. E. Gill, W. Murray, M. A. Saunders and M. H. Wright: Model Building and Practical Aspects of Nonlinear Programming. In Computational Mathematical Programming, Schittkowski, K., ed., Springer-Verlag, Berlin, Heidelberg (1985) 209–247CrossRefGoogle Scholar
  14. 14.
    S. M. Robinson: Perturbed Kuhn-Tucker Points and Rate of Convergence for a Class of Nonlinear Programming Algorithms. Mathematical Programming 7 (1974) 1–16MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Christof Büskens
    • 1
  • Helmut Maurer
    • 2
  1. 1.Lehrstuhl für IngenieurmathematikUniversität BayreuthGermany
  2. 2.Institut für Numerische MathematikUniversität MünsterGermany

Personalised recommendations