Abstract
This paper presents an integrated approach to sensitivity analysis in some linear and non-linear programming problems. Closed formulas for the sensitivities of the objective function and primal and dual variables with respect to all parameters for some classes of problems are obtained. As particular cases, the sensitivities with respect to all data values, i.e., cost coefficients, constraints coefficients and right hand side terms of the constraints are provided for these classes of problems as closed formulas. The method is illustrated by its application to several examples.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bazaraa MS, Sherali HD, Shetty CM (1993) Nonlinear programming, theory and algorithms, 2nd edn. Wiley, New York
Bonnans JF, Shapiro A (1998) Optimization problems with perturbations: a guided tour. SIAM Rev 40:228–264
Bonnans JF, Shapiro A (2000) Perturbation analysis of optimization problems. Springer, New York
Castillo E, Cobo A, Jubete F, Pruneda RE (1999) Orthogonal sets and polar methods in linear algebra: applications to matrix calculations, systems of equations and inequalities, and linear programming. Wiley, New York
Castillo E, Conejo AJ, Pedregal P, García R, Alguacil N (2001) Building and solving mathematical programming models in engineering and science. Pure and applied mathematics. Wiley, New York
Castillo E, Hadi AS, Conejo AJ, Fernández-Canteli A (2004) A general method for local sensitivity analysis with application to regression models and other optimization problems. Technometrics 46(4):430–444
Castillo E, Conejo AJ, Castillo C, Mínguez R, Ortigosa D (2006) A perturbation approach to sensitivity analysis in mathematical programming. JOTA 128(1):49–74
Enevoldsen I (1994) Sensitivity analysis of reliability-based optimal solution. J Eng Mech ASCE 120(1):198–205
Fiacco AV (1976) Sensitivity analysis for nonlinear programming using penalty functions. Math Program 10:287–311
Fiacco AV (1983) Introduction to sensitivity and stability analysis. Academic, New York
Fiacco AV, McCormick GP (1990) Nonlinear programming: sequential unconstrained minimization techniques. Classics in applied mathematics. SIAM, Philadelphia
Gauvin J (1994) Theory of nonconvex programming. Les Publications CRM, Montreal
Klatte D, Kummer B (2002) Nonsmooth equations in optimization—regularity, calculus, methods and applications. Nonconvex optimization and its applications. Kluwer Academic, Dordrecht
Luenberger DG (1989) Linear and nonlinear programming, 2nd edn. Addison–Wesley, Reading
Murty KG (1983) Linear programming. Wiley, New York
Ruiz-Tolosa JR, Castillo E (2005) From vectors to tensors. Springer, New York
Sobiesky JS, Barthelemy JF, Riley KM (1982) Sensitivity of optimal solutions of problem parameters. AIAA J 20(9):1291–1299
Sorensen JD, Enevoldsen I (1992) Sensitivity Analysis in reliability-based shape optimization. In: Optimization and artificial intelligence in civil and structural engineering, vol I. Kluwer Academic, Netherlands, pp 617–637
Vanderplaats G (1984) Numerical optimization techniques for engineering design with applications. McGraw–Hill, New York
Yudin DB, Goldstein EG (1965) Linear programming. Translated from Russian by Z Lerman. Jerusalem, Israel Program for Scientific Translations
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Castillo, E., Conejo, A.J., Castillo, C. et al. Closed formulas in local sensitivity analysis for some classes of linear and non-linear problems. TOP 15, 355–371 (2007). https://doi.org/10.1007/s11750-007-0023-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11750-007-0023-2