Geodesic
Lexicographic optima in the multicriteria discrete optimization problem
Matematičeskie zametki, Tome 58 (1995) no. 3, pp. 365-371.

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{MZM_1995_58_3_a4,
     author = {V. A. Emelichev and M. K. Kravtsov},
     title = {Lexicographic optima in the multicriteria discrete optimization problem},
     journal = {Matemati\v{c}eskie zametki},
     pages = {365--371},
     publisher = {mathdoc},
     volume = {58},
     number = {3},
     year = {1995},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_1995_58_3_a4/}
}
TY  - JOUR
AU  - V. A. Emelichev
AU  - M. K. Kravtsov
TI  - Lexicographic optima in the multicriteria discrete optimization problem
JO  - Matematičeskie zametki
PY  - 1995
SP  - 365
EP  - 371
VL  - 58
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_1995_58_3_a4/
LA  - ru
ID  - MZM_1995_58_3_a4
ER  - 
%0 Journal Article
%A V. A. Emelichev
%A M. K. Kravtsov
%T Lexicographic optima in the multicriteria discrete optimization problem
%J Matematičeskie zametki
%D 1995
%P 365-371
%V 58
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_1995_58_3_a4/
%G ru
%F MZM_1995_58_3_a4
V. A. Emelichev; M. K. Kravtsov. Lexicographic optima in the multicriteria discrete optimization problem. Matematičeskie zametki, Tome 58 (1995) no. 3, pp. 365-371. http://geodesic.mathdoc.fr/item/MZM_1995_58_3_a4/

[1] Mikhalevich V. S., Volkovich V. L., Vychislitelnye metody issledovaniya i proektirovaniya slozhnykh sistem, Nauka, M., 1982 | Zbl

[2] Dubov Yu. A., Travkin S. I., Yakimets V. N., Mnogokriterialnye modeli formirovaniya i vybora variantov sistem, Nauka, M., 1986

[3] Podinovskii V. V., Nogin V. D., Pareto-optimalnye resheniya mnogokriterialnykh zadach, Nauka, M., 1982 | Zbl

[4] Burkard R. E., Keiding H., Krarup J., Pruzan P. M., “A relationship between optimality and efficiency in multikriteria 0–1 programming problems”, Comp. Operat. Research, 8:4 (1981), 241–247 | DOI

[5] Emelichev V. A., Perepelitsa V. A., “Mnogokriterialnye zadachi ob ostovakh grafa”, DAN SSSR, 298:3 (1988), 544–547 | MR

[6] Emelichev V. A., Perepelitsa V. A., “K vychislitelnoi slozhnosti mnogokriterialnykh zadach”, Izv. AN SSSR. Tekhn. kibernetika, 1988, no. 1, 78–85 | MR | Zbl

[7] Emelichev V. A., Perepelitsa V. A., “O nekotorykh algoritmicheskikh problemakh mnogokriterialnoi optimizatsii na grafakh”, Zh. vychisl. matem. i matem. fiz., 29:2 (1989), 171–183 | MR

[8] Emelichev V. A., Perepeliza V. A., “Complexity of vektor optimization problems on graphs”, Optimization, 22:6 (1991), 903–918 | MR | Zbl

[9] Emelichev V. A., Kravtsov M. K., “O nerazreshimosti vektornykh zadach diskretnoi optimizatsii na sistemakh podmnozhestv v klasse algoritmov lineinoi svertki kriteriev”, Dokl. RAN, 334:1 (1994), 9–11 | MR | Zbl

[10] Podinovskii V. V., Gavrilov V. M., Optimizatsiya po posledovatelno primenyaemym kriteriyam, Sovetskoe radio, M., 1975 | Zbl

[11] Sergienko I. V., Matematicheskie modeli i metody resheniya zadach diskretnoi optimizatsii, Naukova dumka, Kiev, 1985

[12] Perepelitsa V. A., Sergienko I. V., “Issledovanie odnogo klassa tselochislennykh mnogokriterialnykh zadach”, ZhVM i MF, 28:3 (1988), 400–419 | MR | Zbl

[13] Zimmermann U., “Some partial orders related to Boolean optimization and the Greedy algorithm”, Ann. of Discrete Math., 1 (1977), 539–550 | DOI | MR | Zbl

[14] Kravtsov M. K., Sherman A. Kh., “O reshenii kombinatornykh zadach optimizatsii s minimaksnymi kriteriyami”, Kibernetika, 1989, no. 3, 71–77 | MR | Zbl

[15] Rainer E., Burkard Franz Rendl, “Lexicographic bottleneck problems”, Operat. Research Lett., 10 (1991), 303–308 | DOI | MR