Universal procedure for constructing a Pareto set
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 57 (2017) no. 1, pp. 30-48
Cet article a éte moissonné depuis la source Math-Net.Ru
A procedure for Pareto set construction that admits the use of a broad class of numerical methods for scalar optimization is considered.
@article{ZVMMF_2017_57_1_a3,
author = {Ya. I. Rabinovich},
title = {Universal procedure for constructing a {Pareto} set},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {30--48},
year = {2017},
volume = {57},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_2017_57_1_a3/}
}
Ya. I. Rabinovich. Universal procedure for constructing a Pareto set. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 57 (2017) no. 1, pp. 30-48. http://geodesic.mathdoc.fr/item/ZVMMF_2017_57_1_a3/
[1] Germeier Yu. B., Vvedenie v teoriyu issledovaniya operatsii, Nauka, M., 1971 | MR
[2] Rabinovich Ya. I., “Postroenie mnozhestva effektivnykh vektorov metodom $\varepsilon$-vozmuschenii”, Zh. vychisl. matem. i matem. fiz., 45:5 (2005), 824–845 | Zbl
[3] Rabinovich Ya. I., Postroenie mnozhestva effektivnykh vektornykh otsenok i zadacha sravneniya approksimatsii, VTs RAN, M., 2012
[4] Sukharev A. G., Timokhov A. V., Fedorov V. V., Kurs metodov optimizatsii, Nauka, M., 1986 | MR
[5] Bazara M., Shetti K., Nelineinoe programmirovanie, Mir, M., 1986