Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. L. Armacost, A. V. Fiacco: Computational Experience in Sensitivity Analysis for Nonlinear Programming. Mathematical Programming 6 (1974) 301–326
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)
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–164
T. J. Beltracchi, G. A. Gabriele: Observations on Extrapolations Using Parameter Sensi-tivity Derivatives. Advances in Design Automation, ASME DE 14 (1988) 165–174
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–130
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)
C. Büskens: Real-Time Solutions for Perturbed Optimal Problems by a Mixed Open- and Closed- Loop Strategy. This volume.
C. Büskens, H. Maurer: Sensitivity Analysis and Real-Time Control of Parametric Opti-mal Control Problems Using Nonlinear Programming Methods. This volume.
C. Büskens, H. Maurer: Real-Time Control of an Industrial Robot. This volume.
A. V. Fiacco: Sensitivity Analysis for Nonlinear Programming Using Penalty Methods. Mathematical Programming 10, (1976) 287–311
A. V. Fiacco: Introduction to Sensitivity and Stability Analysis in Nonlinear Programming. Mathematics in Science and Engineering 165, Academic Press, New York, (1983)
R. Fletcher: Practical Methods of Optimization. 2nd ed., J. Wiley & Sons, Chichester/New York4, (1997)
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–247
S. M. Robinson: Perturbed Kuhn-Tucker Points and Rate of Convergence for a Class of Nonlinear Programming Algorithms. Mathematical Programming 7 (1974) 1–16
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Büskens, C., Maurer, H. (2001). Sensitivity Analysis and Real-Time Optimization of Parametric Nonlinear Programming Problems. In: Grötschel, M., Krumke, S.O., Rambau, J. (eds) Online Optimization of Large Scale Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04331-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-662-04331-8_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07633-6
Online ISBN: 978-3-662-04331-8
eBook Packages: Springer Book Archive