Abstract
Active constraint set invariancy sensitivity analysis is concerned with finding the range of parameter variation so that the perturbed problem has still an optimal solution with the same support set that the given optimal solution of the unperturbed problem has. However, in an optimization problem with inequality constraints, active constraint set invariancy sensitivity analysis aims to find the range of parameter variation, where the active constraints in a given optimal solution remains invariant.
For the sake of simplicity, we consider the primal problem in standard form and consequently its dual may have an optimal solution with some active constraints. In this paper, the following question is answered: “what is the range of the parameter, where for each parameter value in this range, a dual optimal solution exists with exactly the same set of positive slack variables as for the current dual optimal solution?”. The differences of the results between the linear and convex quadratic optimization problems are highlighted too.
Similar content being viewed by others
References
Goldman, A.J., Tucker, A.W.: Theory of linear programming. In: Kuhn, H.W., Tucker, A.W. (eds.) Linear Inequalities and Related Systems. Annals of Mathematical Studies, vol. 38, pp. 63–97. Princeton University Press, Princeton (1956)
Dantzig, G.B. (ed.): Linear Programming and Extensions. Princeton University Press, Princeton (1963)
Roos, C., Terlaky, T., Vial, J.-P. (eds.): Theory and Algorithms for Linear Optimization: An Interior Point Approach. Wiley, Chichester (1997)
Illés, T., Peng, J., Roos, C., Terlaky, T.: A strongly polynomial rounding procedure yielding a maximally complementary solution for P *(κ) linear complementarity problems. SIAM J. Optim. 11(2), 320–340 (2000)
Jarvis, J.J., Sherali, H.D., Bazaraa, M.S. (eds.): Linear Programming and Network Flows. Wiley, New York (1997)
Murty, K.G. (ed.): Linear Programming. Wiley, New York (1983)
Jansen, B., de Jong, J.J., Roos, C., Terlaky, T.: Sensitivity analysis in linear programming: just be careful!. Eur. J. Oper. Res. 101, 15–28 (1997)
Karmarkar, N.K.: A new polynomial-time algorithm for linear programming. Combinatorica 4, 375–395 (1984)
Adler, I., Monteiro, R.: A geometric view of parametric linear programming. Algorithmica 8, 161–176 (1992)
Jansen, B., Roos, C., Terlaky, T.: An interior point approach to postoptimal and parametric analysis in linear programming. Report No. 92-21, Faculty of Technical Mathematics and Information/Computer science, Delft University of Technology (1992)
Gal, T., Greenberg, H.J. (eds.): Advances in Sensitivity Analysis and Parametric Programming. Kluwer Academic, London (1997)
Greenberg, H.J.: Simultaneous primal-dual right-hand-side sensitivity analysis from a primal-dual strictly complementary solution of a linear program. SIAM J. Optim. 10, 427–442 (2000)
Ghaffari Hadigheh, A.R., Romanko, O., Terlaky, T.: Sensitivity analysis in convex quadratic optimization: simultaneous perturbation of the objective and right-hand-side vectors. Algorithmic Oper. Res. (2007, to appear)
Koltai, T., Terlaky, T.: The difference between managerial and mathematical interpretation of sensitivity analysis results in linear programming. Int. J. Prod. Econ. 65, 257–274 (2000)
Ghaffari Hadigheh, A.R., Terlaky, T.: Sensitivity analysis in linear optimization: invariant support set intervals. Eur. J. Oper. Res. 169, 1158–1175 (2005)
Ghaffari Hadigheh, A.R., Terlaky, T.: Sensitivity analysis in convex quadratic optimization: invariant support set intervals. Optimization 54(1), 59–69 (2005)
Ghaffari Hadigheh, A.R., Mirnia, K., Terlaky, T.: Sensitivity analysis in linear and convex quadratic optimization: invariant active constraint set and invariant set intervals. Inf. Syst. Oper. Res. (INFOR) 44(2), 129–155 (2006)
Dorn, W.S.: Duality in quadratic programming. Q. Appl. Math. 18, 155–162 (1960)
Berkelaar, A.B., Jansen, B., Roos, C., Terlaky, T.: An interior point approach to parametric convex quadratic programming. Working paper, Erasmus University Rotterdam, Rotterdam, Netherlands (1997)
Nesterov, Y., Nemirovskii, A. (eds.): Interior Point Polynomial Methods in Convex Programming: Theory and Applications. SIAM, Philadelphia (1994)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by P.M. Pardalos.
Supported by the Research Institute for Fundamental Science, Tabriz, Iran.
Rights and permissions
About this article
Cite this article
Ghaffari Hadigheh, A., Mirnia, K. & Terlaky, T. Active Constraint Set Invariancy Sensitivity Analysis in Linear Optimization. J Optim Theory Appl 133, 303–315 (2007). https://doi.org/10.1007/s10957-007-9201-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-007-9201-5