Abstract
We consider a vector linear combinatorial optimization problem in which initial coefficients of objective functions are subject to perturbations. For Pareto and lexicographic principles of efficiency we introduce appropriate measures of the quality of a given feasible solution. These measures correspond to so-called stability and accuracy functions defined earlier for scalar optimization problems. Then we study properties of such functions and calculate the maximum norms of perturbations for which an efficient solution preserves the efficiency.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chakravarty, N. and A. Wagelmans. (1999). “Calculation of Stability Radii for Combinatorial Optimization Problems.” Operations Research Letters, 23, 1–7.
Emelichev, V., E. Girlich, Y. Nikulin, and D. Podkopaev. (2002). “Stability and Regularization of Vector Problems of Integer Linear Programming.” Optimization, 51, 645–676.
Emelichev, V. and M. Kravtsov (1995). “On Stability in Trajectory Problems of Vector Optimization.” Kibernetika i systemny analiz, 4, 137–143.
Ehrgott, M. (1997). Multiple Criteria Optimization. Classification and Methodology. Aachen: Shaker.
Ehrgott, M. and X. Gandibleux. (2000). “A Survey and Annotated Bibliography of Multicriteria Combinatorial Optimization.” OR Spektrum, 22, 425–460.
Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability, A Guide to the Theory of NP-Completeness. New York: W.H. Freeman and Company.
Greenberg, H. (1998). “An Annotated Bibliography for Post-Solution Analysis in Mixed Integer and Combinatorial Optimization.” In D. Woodruff (ed.) Advances in Computational and Stochastic Optimization, Logic Programming and Heuristic Search, pp. 97–148. Dordrecht: Kluwer Academic Publishers.
Hamacher, H.W. and M. Queyranne. (1985/6). “K Best Solutions to Combinatorial Optimization Problems.” Annals of Operations Research, 4, 123–143.
van Hoesel, S. and A. Wagelmans. (1999). “On the Complexity of Postoptimality Analysis of 0/1 Programs.” Discrete Applied Mathematics, 91, 251–263.
Leontev, V.K. (1975). “Stability of the Traveling Salesman Problem.” Computational Mathematics and Mathematical Physics, 15, 1293–1309.
Leontev, V. K. (1979). “Stability in Linear Discrete Problems.” Problemy Kibernetiki, 35, 169–185.
Libura, M. (1999). “On Accuracy of Solution for Combinatorial Optimization Problems with Perturbed Coefficients of the Objective Function.” Annals of Operation Research, 86, 53–62.
Libura, M. (2000). “Quality of Solutions for Perturbed Combinatorial Optimization Problems.” Control and Cybernetics, 29, 199–219.
Libura, M., E.S. van der Poort, G. Sierksma, and J.A.A. van der Veen. (1998). “Stability Aspects of the Traveling Salesman Problem Based on k-Best Solutions.” Discrete Applied Mathematics, 87, 159–185.
Pareto, V. (1909). Manuel d’ecoonomie politique. Paris: Qiard.
Sotskov, Y., V. Leontev, and E. Gordeev. (1995). “Some Concepts of Stability Analysis in Combinatorial Optimization.” Discrete Applied Mathematics, 58, 169–190.
Sotskov, Y., V. Tanaev, and F. Werner. (1998). “Stability Radius of an Optimal Schedule: A Survey and Recent Developments.” Industrial Applications of Discrete Optimization, 16, 72–108.
Steuer, R.E. (1986). Multiple Criteria Optimization: Theory, Computation and Application. New York: John Wiley & Sons.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was partially supported through NATO Science Fellowship grant.
Rights and permissions
About this article
Cite this article
Libura, M., Nikulin, Y. Stability and accuracy functions in multicriteria linear combinatorial optimization problems. Ann Oper Res 147, 255–267 (2006). https://doi.org/10.1007/s10479-006-0071-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-006-0071-2