Abstract
This paper presents a perturbation approach for performing sensitivity analysis of mathematical programming problems. Contrary to standard methods, the active constraints are not assumed to remain active if the problem data are perturbed, nor the partial derivatives are assumed to exist. In other words, all the elements, variables, parameters, Karush–Kuhn–Tucker multipliers, and objective function values may vary provided that optimality is maintained and the general structure of a feasible perturbation (which is a polyhedral cone) is obtained. This allows determining: (a) the local sensitivities, (b) whether or not partial derivatives exist, and (c) if the directional derivative for a given direction exists. A method for the simultaneous obtention of the sensitivities of the objective function optimal value and the primal and dual variable values with respect to data is given. Three examples illustrate the concepts presented and the proposed methodology. Finally, some relevant conclusions are drawn.
Similar content being viewed by others
References
N. G. Vanderplaats (1984) Numerical Optimization Techniques for Engineering Design McGraw-Hill New York NY
J. S. Sobieski J. F. Barthelemy K. M. Riley (1982) ArticleTitle Sensitivity of Optimal Solutions to Problems Parameters AIAA Journal. 20 1291–1299
I. Enevoldsen (1994) ArticleTitle Sensitivity Analysis of Reliability-Based Optimal Solutions ASCE Journal of Engineering Mechanics. 120 198–205
C. Roos T. Terlaky J. P. Vial (1997) Theory and Algorithms for Linear Optimization: An Interior-Point Approach John Wiley and Sons Chichester, UK
P. Bjerager S. Krenk (1989) ArticleTitle Parametric Sensitivity in First-Order Reliability Theory ASCE Journal Engineering Mechanics. 115 1577–1582
J. D. Sorensen I. Enevoldsen (1992) Sensitivity Analysis in Reliability-Based Shape Optimization, Optimization and Artificial Intelligence in Civil and Structural Engineering Kluwer Academic Publishers Dordrecht
D. G. Luenberger (1989) Linear and Nonlinear Programming, 2nd Edition Addison-Wesley, Reading Massachusetts
M. S. Bazaraa H. D. Sherali C. M. Shetty (1993) Nonlinear Programming:Theory and Algorithms, 2nd Edition John Wiley and Sons New York, NY
M. Padberg (1995) Linear Optimization and Extensions Springer Berlin, Germany
E. Castillo A. Cobo F. Jubete RE. Pruneda C. Castillo (2000) ArticleTitle An Orthogonally-Based Pivoting Transformation of Matrices and Some Applications SIAM Journal on Matrix Analysis and Applications. 22 666–681 Occurrence Handle10.1137/S0895479898349720 Occurrence Handle2001i:65037
E. Castillo F. Jubete E. Pruneda C. Solares (2002) ArticleTitle Obtaining Simultaneous Solutions of Linear Subsystems of Equations and Inequalities Linear Algebra and Its Applications. 346 131–154 Occurrence Handle10.1016/S0024-3795(01)00500-6 Occurrence Handle2003c:15025
E. Castillo A. Cobo F. Jubete R. E. Pruneda (1999) Orthogonal Sets and Polar Methods in Linear Algebra: Applications to Matrix Calculations, Systems of Equations and Inequalities, and Linear Programming John Wiley and Sons New York, NY
W. H. Press S. A. Teukolsky W. T. Vetterling B. P. Flannery (1992) Numerical Recipes in C Cambridge University Press New York, NY
A. V. Fiacco (1983) Introduction to Sensitivity and Stability Analysis in Nonlinear Programming Academic Press New York, NY
E. Castillo A. J. Conejo P. Pedregal R. García N. Alguacil (2002) Building and Solving Mathematical Programming Models in Engineering and Science John Wiley & Sons New York, NY
Author information
Authors and Affiliations
Additional information
Communicated by M. A. Simaan
The authors are indebted to the Ministry of Science and Education of Spain, Projects CICYT DPI2002-04172-C04-02 and CICYT DPI2003-01362, and to the Fulbright Commission for partial support. The authors are grateful to the referees for comments improving the quality of the paper.
Rights and permissions
About this article
Cite this article
Castillo, E., Conejo, A.J., Castillo, C. et al. Perturbation Approach to Sensitivity Analysis in Mathematical Programming. J Optim Theory Appl 128, 49–74 (2006). https://doi.org/10.1007/s10957-005-7557-y
Issue Date:
DOI: https://doi.org/10.1007/s10957-005-7557-y