Geodesic
A~linear convolution of criteria in bicriterial optimization
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (1998), pp. 63-70.

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

@article{IVM_1998_12_a7,
     author = {M. K. Kravtsov and O. A. Yanushkevich},
     title = {A~linear convolution of criteria in bicriterial optimization},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {63--70},
     publisher = {mathdoc},
     number = {12},
     year = {1998},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_1998_12_a7/}
}
TY  - JOUR
AU  - M. K. Kravtsov
AU  - O. A. Yanushkevich
TI  - A~linear convolution of criteria in bicriterial optimization
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 1998
SP  - 63
EP  - 70
IS  - 12
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_1998_12_a7/
LA  - ru
ID  - IVM_1998_12_a7
ER  - 
%0 Journal Article
%A M. K. Kravtsov
%A O. A. Yanushkevich
%T A~linear convolution of criteria in bicriterial optimization
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 1998
%P 63-70
%N 12
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_1998_12_a7/
%G ru
%F IVM_1998_12_a7
M. K. Kravtsov; O. A. Yanushkevich. A~linear convolution of criteria in bicriterial optimization. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (1998), pp. 63-70. http://geodesic.mathdoc.fr/item/IVM_1998_12_a7/

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

[2] Podinovskii V. V., Nogin V. D., Pareto-optimalnye resheniya mnogokriterialnykh zadach, Nauka, M., 1982, 256 pp. | MR

[3] Dubov Yu. A., Travkin S. I., Yakimets V. N., Mnogokriterialnye modeli formirovaniya i vybora variantov sistem, Nauka, M., 1986, 296 pp. | MR

[4] Shtoier R., Mnogokriterialnaya optimizatsiya. Teoriya, vychisleniya i prilozheniya, Radio i svyaz, M., 1992, 504 pp. | MR

[5] Geoffrion A. M., “Proper efficiency and the theory of vector maximization”, J. Math. Anal. and Appl., 22:3 (1968), 618–630 | DOI | MR | Zbl

[6] Emelichev V. A., Perepelitsa V. A., “Slozhnost diskretnykh mnogokriterialnykh zadach”, Diskretn. matem., 6:1 (1994), 3–33 | Zbl

[7] 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

[8] Emelichev V. A., Kravtsov M. K., “O zadachakh vektornoi diskretnoi optimizatsii na sistemakh podmnozhestv, nerazreshimykh s pomoschyu algoritmov lineinoi svertki”, Zhurn. vychisl. matem. i matem. fiz., 34:7 (1994), 1082–1094 | MR | Zbl

[9] Kravtsov M. K., “Nerazreshimost zadach vektornoi diskretnoi optimizatsii v klasse algoritmov lineinoi svertki kriteriev”, Diskretn. matem., 8:2 (1996), 89–96 | Zbl

[10] Melamed I. I., Sigal I. Kh., “Issledovanie lineinoi svertki kriteriev v mnogokriterialnom diskretnom programmirovanii”, Zhurn. vychisl. matem. i matem. fiz., 35:8 (1995), 1260–1270 | MR | Zbl

[11] Emelichev V. A., Kravtsov M. K., Yanushkevich O. A., “Usloviya pareto-optimalnosti v odnoi diskretnoi vektornoi zadache na sisteme podmnozhestv”, Zhurn. vychisl. matem. i matem. fiz., 35:11 (1995), 1641–1652 | MR | Zbl

[12] Podinovskii V. V., Gavrilov V. M., Optimizatsiya po posledovatelno primenyaemym kriteriyam, Sovetskoe radio, M., 1975, 192 pp. | MR | Zbl

[13] Emelichev V. A., Kravtsov M. K., Yanushkevich O. A., “Leksikograficheskie optimumy mnogokriterialnoi zadachi diskretnoi optimizatsii”, Matem. zametki, 58:3 (1995), 365–371 | MR

[14] Emelichev V. A., Gladkii A. A., Yanushkevich O. A., “O mnogokriterialnykh zadachakh nakhozhdeniya leksikograficheskikh optimumov”, Vestsi ANB. Ser. fiz.-matem. navuk, 1996, no. 3, 82–86 | MR | Zbl

[15] Emelichev V. A., Girlikh E., Yanushkevich O. A., “Leksikograficheskie optimumy mnogokriterialnoi zadachi”, Diskretn. anal. i issled. operatsii. Ser. 1, 4:2 (1997), 3–14 | MR

[16] Emelichev V. A., Kravtsov M. K., Yanushkevich O. A., “Razreshimost vektornoi traektornoi zadachi na “uzkie mesta” s pomoschyu algoritma lineinoi svertki kriteriev”, Dokl. AN Belarusi, 40:4 (1996), 29–33 | MR | Zbl

[17] Kravtsov M. K., Yanushkevich O. A., “O razreshimosti vektornoi zadachi s pomoschyu algoritma lineinoi svertki kriteriev”, Matem. zametki, 62:4 (1997), 502–509 | MR | Zbl

[18] Girlikh E., Kovalev M. M., Kravtsov M. K., Yanushkevich O. A., “Usloviya razreshimosti vektornykh zadach s pomoschyu lineinoi svertki kriteriev”, Kibernet. i sistem. anal., 1997, no. 5, 3–16 | MR

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

[20] Emelichev V. A., Yanushkevich O. A., “Usloviya pareto-optimalnosti v diskretnykh vektornykh zadachakh optimizatsii”, Diskretn. matem., 9:3 (1997), 153–160 | MR | Zbl

[21] Melamed I. I., Sigal I. Kh., Zadacha kommivoyazhera: nekotorye voprosy teorii, algoritmy, eksperiment, VTs RAN, M., 1997, 32 pp.