Abstract
We consider a multicriteria combinatorial problem with majority optimality principle whose particular criteria are of the form MINSUM, MINMAX, and MINMIN. We obtain a lower attainable bound for the radius of quasistability of such a problem in the case of the Chebyshev norm on the space of perturbing parameters of the vector criterion. We give sufficient conditions for the quasistability of the problem; these are also necessary in the case of linear special criteria.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
V. A. Emelichev and D. P. Podkopaev, “On a quantative measure of stability for a vector problem of integer programming” Zh. Vychisl. Mat. i Mat. Fiz. [Comput. Math. and Math. Phys.], 38 (1998), no. 11, 1801–1805.
V. A. Emelichev, M. K. Kravtsov, and D. P. Podkopaev, On the Quasistability of Trajectory Problems of Vector Optimization “On the quasistability of trajectory problems of vector optimization,” Mat. Zametki [Math. Notes], 63 (1998), no. 1, 21–27.
V. A. Emelichev and R. A. Berdysheva, “On the radii of stability and quasistability of vector trajectory problems of lexicographic optimization,” Discrete Mathematics, 10 (1998), no. 1, 20–27.
R. A. Berdysheva and V. A. Emelichev, “Certain forms of stability of combinatorial problems of lexicographic optimization,” Izv. Vyssh. Uchebn. Zaved. Mat. [Russian Math. (Iz. VUZ)] (1998), no.12, 11–21.
V. A. Emelichev and R. A. Berdysheva, “On the stability and quasistability of a trajectory problem of successive optimization,” Dokl. NAN Belarus, 43 (1999), no. 3, 41–44.
V. A. Emelichev and R. A. Berdysheva, “On the measure of stability of for a problem of integer lexicographic optimization,” Izv. NAN Belarus. Ser. Fiz.-Mat. Nauk (1999), no. 4, 119–124.
V. K. Leont'ev, “Stability in linear discrete problems,” Problems of Cybernetics (1979), no. 35, 169–184.
V. A. Emelichev and Yu. V. Stepanishyna, “Stability of a majority efficient solution of a vector linear trajectory problem,” Computer Sci. J. Moldova, 7 (1999), no. 3, 291–307.
B. G. Mirkin, The Group Choice Problem [in Russian], Nauka, Moscow, 1974.
L. A. Sholomov, Logical Methods of Studying Discrete Choice Models [in Russian], Nauka, Moscow, 1989.
M. A. Aizerman and F. T. Aleskerov, Choice of Variants: Foundations of Theory [in Russian], Nauka, Moscow, 1990.
H. Moulin, Axioms of Cooperative Decision Making, Cambridge Univ.Press, Cambridge-New York, 1988.
É. N. Gordeev and V. K. Leont'ev, “A general approach to the study of stability of solutions in discrete optimization problems,” Zh. Vychisl. Mat. i Mat. Fiz. [Comput. Math. and Math. Phys.], 36 (1996), no. 1, 66–72.
V. I. Artemenko, É. N. Gordeev, Yu. I. Zhuravlev, et al., “A method for forming optimal program trajectories of a manipulator robot,” Cybernatics and System Analysis (1996), no. 5, 82–104.
V. A. Emelichev and M. K. Kravtsov, “On the unsolvability of vector discrete optimization problems on systems of subsets in the class of algorithms involving the linear convolution of criteria,” Dokl. Ross. Akad. Nauk [Russian Acad. Sci. Dokl. Math.], 334 (1994), no. 1, 9–11.
V. A. Emelichev and M. K. Kravtsov, “On the unsolvability of vector discrete optimization problems on systems of subsets by means of the linear convolution algorithm,” Zh. Vychisl. Mat. i Mat. Fiz. [Comput. Math. and Math. Phys.], 34 (1994), no. 7, 1082–1094.
V. A. Emelichev and M. K. Kravtsov, “On combinatorial problems of vector optimization,” Discrete Mathematics, 7 (1995), no. 1, 3–18.
Yu. N. Sotskov, V. K. Leont'ev, and E. N. Gordeev, “Some concepts of stability analysis in combinatorial optimization,” Discrete Appl. Math., 58 (1995), 169–190.
V. V. Podinovskii and V. D. Nogin, Pareto-Optimal Solutions of Multicriteria Problems [in Russian], Nauka, Moscow, 1982.
J. C. Borda, Memoires sur les elections au scrutin. Histoires de l'academi royale des sciences, Paris, 1781.
M. Condorcet, Essai sur l'application de l'analyse à la probabilité des decisions rendues à la pluralité des voix, Paris, 1785.
K. J. Arrow, Social Choice and Individual Values, 2nd edition, J. Wiley, New York, 1963.
V. I. Vol'skii and Z. M. Lezina, Voting in Small Groups: Procedures and Methods of Comparative Analysis [in Russian], Nauka, Moscow, 1991.
L. N. Kozeratskaya, T. T. Lebedeva, and T. I. Sergienko, “Problems of integer programming with vector criterion: parametric analysis and the study of stability,” Dokl. Akad. Nauk SSSR [Soviet Math. Dokl.], 307 (1989), no. 3, 527–529.
I. V. Sergienko, L. N. Kozeratskaya, and T. T. Lebedeva, Study of Stability and Parametric Analysis of Discrete Optimization Problems [in Russian], Naukova Dumka, Kiev, 1995.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Emelichev, V.A., Stepanishina, Y.V. Quasistability of a Vector Trajectory Majority Optimization Problem. Mathematical Notes 72, 34–42 (2002). https://doi.org/10.1023/A:1019860803546
Issue Date:
DOI: https://doi.org/10.1023/A:1019860803546