Abstract
It is shown that any lexicographic optimum in vector optimization problems on a finite set of admissible solutions can be obtained by a classical technique, the linear convolution of criteria.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
V. S. Mikhalevich and V. L. Volkovich,Computation Methods of Investigating and Designing Complex Systems [in Russian], Nauka, Moscow (1982).
Yu. A. Dubov, S. I. Travkin, and V. N. Yakimets,Multicriteria Models for Designing and Choosing System Variants [in Russian], Nauka, Moscow (1986).
V. V. Podinovskii and V. D. Nogin,Pareto-Optimal Solutions of Multicriteria Problems [in Russian], Nauka, Moscow (1982).
R. E. Burkard, H. Keiding, J. Krarup, and P. M. Pruzan, “A relationship between optimality and efficiency in multicriteria 0–1 programming problems,”Comp. & Operat. Research,8, No. 4, 241–247 (1981).
V. A. Emelichev and V. A. Perepelitsa, “Multicriteria problems concerning the graph spanning tree,”Dokl. Akad. Nauk SSSR [Soviet Math. Dokl.],298, No. 3, 544–547 (1986).
V. A. Emelichev and V. A. Perepelitsa, “On computational complexity of multicriteria problems,”Izv. Akad. Nauk SSSR Tekhn. Kibernet. [Soviet J. Comput. Systems Sci.], No. 1, 78–85 (1988).
V. A. Emelichev and V. A. Perepelitsa, “Some algorithmic problems of multicriteria optimization on graphs,”Zh. Vychisl. Mat. i Mat. Fiz. [U.S.S.R. Comput. Math. and Math. Phys.],29, No. 2, 171–183 (1989).
V. A. Emelichev and V. A. Perepelitsa, “Complexity of vector optimization problems on graphs,”Optimization,22, No. 6, 903–918 (1991).
V. A. Emelichev and M. K. Kravtsov, “Insolubility of vector discrete optimization problems on systems of subsets in the class of algorithms of linear convolution of criteria,”Dokl. Akad. Nauk SSSR [Soviet Math. Dokl.],334, No. 1, 9–11 (1994).
V. V. Podinovskii and V. M. Gavrilov,Optimization Using Consecutive Criteria [in Russian], Sovetskoe Radio, Moscow (1975).
I. V. Sergienko,Mathematical Models and Methods of Solution of Discrete Optimization Problems [in Russian], Naukova Dumka, Kiev (1985).
V. A. Perepelitsa and I. V. Sergienko, “Investigation of a class of integer multicriteria problems,”Zh. Vychisl. Mat. i Mat. Fiz. [U.S.S.R. Comput. Math. and Math. Phys.],28, No. 3, 400–419 (1989).
U. Zimmermann, “Some partial orders related to Boolean optimization and the greedy algorithm,”Ann. of Discrete Math.,1, 539–550 (1977).
M. K. Kravtsov and A. Kh. Sherman, “Solution of combinatorial optimization problems with minimax criteria,”Kibernetika. [Cybernetics], No. 3, 71–77 (1989).
E. Rainer and F. R. Burkard, “Lexicographic bottleneck problems,”Operat. Research Lett.,10, 303–308 (1991).
Author information
Authors and Affiliations
Additional information
Translated fromMatematicheskie Zametki, Vol. 58, No. 3, pp. 365–370, September, 1995.
This work was financed by the Foundation for Basic Research of the Belarus Republic (grant No. 242 23-70).
Rights and permissions
About this article
Cite this article
Emelichev, V.A., Kravtsov, M.K. & Yanushkevich, O.A. Lexicographic optima in the multicriteria discrete optimization problem. Math Notes 58, 928–932 (1995). https://doi.org/10.1007/BF02304769
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02304769