Parametrization of the optimality principle (``from Pareto to Slater'') and the stability of multicriterial trajectory problems

S. E. Bukhtoyarov ; V. A. Emelichev

Diskretnyj analiz i issledovanie operacij, Tome 10 (2003) no. 2, pp. 3-18.

Bibliographie

[1] Artemenko V. I., Gordeev E. N.,Zhuravlev Yu. I., Kulikov F. M., Naumov V. B., Potapchuk G. A., Sergienko I. V., Smetanin Yu. G., Urkhard R., Khodzinskii A. N., Khonderd G., “Metod formirovaniya optimalnykh programmnykh traektorii peremescheniya robota-manipulyatora”, Kibernetika i sistemnyi analiz, 1996, no. 5, 84–106 | MR | Zbl

[2] Belousov E. G., Andronov V. G., Razreshimost i ustoichivost zadach polinomialnogo programmirovaniya, Izd-vo MGU, M., 1993 | MR | Zbl

[3] Berdysheva R. A., Emelichev V. A., “Nekotorye vidy ustoichivosti kombinatornoi zadachi leksikograficheskoi optimizatsii”, Izv. vuzov. Matematika, 1998, no. 12, 11–21 | MR | Zbl

[4] Bukhtoyarov S. E., Emelichev V. A., “Konechnye koalitsionnye igry: parametrizatsiya printsipa optimalnosti (“ot Pareto do Nesha”) i ustoichivost obobschenno-effektivnykh situatsii”, Dokl. NAN Belarusi, 46:6 (2002), 36–38 | MR

[5] Gordeev E. N., “Ustoichivost reshenii v zadache o kratchaishem puti na grafe”, Diskretnaya matematika, 1:3 (1989), 39–46 | MR | Zbl

[6] Gordeev E. N., “Issledovanie ustoichivosti v optimizatsionnykh zadachakh na matroidakh v metrike $l_1$”, Kibernetika i sistemnyi analiz, 2001, no. 2, 132–144 | MR | Zbl

[7] Gordeev E. N., Leontev V. K., “Ustoichivost v zadachakh na uzkie mesta”, Zhurn. vychisl. matematiki i matem. fiziki, 20:4 (1980), 1071–1075 | MR

[8] Gordeev E. N., Leontev V. K., “Obschii podkhod k issledovaniyu ustoichivosti reshenii v zadachakh diskretnoi optimizatsii”, Zhurn. vychisl. matematiki i matem. fiziki, 36:1 (1996), 66–72 | MR | Zbl

[9] Emelichev V. A., Berdysheva R. A., “O radiusakh ustoichivosti, kvaziustoichivosti i stabilnosti vektornoi traektornoi zadachi leksikograficheskoi optimizatsii”, Diskretnaya matematika, 10:1 (1998), 20–27 | MR | Zbl

[10] Emelichev V. A., Girlikh E., Podkopaev D. P., “Ob ustoichivosti effektivnykh reshenii vektornoi traektornoi zadachi diskretnoi optimizatsii”, Izv. AN Respubliki Moldova. Matematika, 1996, no. 3, 5–16 | MR | Zbl

[11] Emelichev V. A., Kravtsov M. K., “Ob ustoichivosti v vektornykh traektornykh zadachakh diskretnoi optimizatsii”, Kibernetika i sistemnyi analiz, 1995, no. 4, 137–143 | MR | Zbl

[12] Emelichev V. A., Krichko V. N., “Radius ustoichivosti effektivnogo resheniya vektornoi kvadratichnoi zadachi buleva programmirovaniya”, Zhurn. vychisl. matematiki i matem. fiziki, 41:2 (2001), 346–350 | MR | Zbl

[13] Emelichev V. A., Nikulin Yu. V., “Ob ustoichivosti effektivnogo resheniya vektornoi zadachi tselochislennogo lineinogo programmirovaniya”, Doklady NAN Belarusi, 44:4 (2000), 26–28 | MR

[14] Emelichev V. A., Pashkevich A. V., “O parametrizatsii printsipa optimalnosti v kriterialnom prostranstve”, Diskret. analiz i issled. operatsii. Ser. 2, 9:1 (2002), 21–32 | MR

[15] Emelichev V. A., Podkopaev D. P., “Ustoichivost i regulyarizatsiya vektornykh zadach tselochislennogo lineinogo programmirovaniya”, Diskret. analiz i issled. operatsii. Ser. 2, 8:1 (2001), 47–69 | MR | Zbl

[16] Emelichev V. A., Pokhilko V. G., “Analiz chuvstvitelnosti effektivnykh reshenii vektornoi zadachi minimizatsii lineinykh form na mnozhestve podstanovok”, Diskretnaya matematika, 12:3 (2000), 37–48 | MR | Zbl

[17] Emelichev V. A., Stepanishina Yu. V., “Mnogokriterialnye kombinatornye lineinye zadachi: parametrizatsiya printsipa optimalnosti i ustoichivost effektivnykh reshenii”, Diskretnaya matematika, 13:4 (2001), 43–51 | MR | Zbl

[18] Kozeratskaya L. N., Lebedeva T. T., Sergienko I. V., “Issledovanie ustoichivosti zadach diskretnoi optimizatsii”, Kibernetika i sistemnyi analiz, 1993, no. 3, 78–93 | MR | Zbl

[19] Leontev V. K., “Ustoichivost zadachi kommivoyazhera”, Zhurn. vychisl. matematiki i matem. fiziki, 15:5 (1975), 1298–1309 | MR

[20] Leontev V. K., “Ustoichivost v lineinykh diskretnykh zadachakh”, Problemy kibernetiki, no. 35, Nauka, M., 1979, 169–184 | MR

[21] Leontev V. K., Gordeev E. N., “Kachestvennye issledovaniya traektornykh zadach”, Kibernetika, 1986, no. 5, 82–90 | MR

[22] Nesh Dzh., “Beskoalitsionnye igry”, Matrichnye igry, Fizmatgiz, M., 1961, 205–221

[23] Podkopaev D. P., Ustoichivost vektornykh zadach diskretnoi optimizatsii, Avtoref. dis. $\dots$ kand. fiz.-matem. nauk, Institut matematiki NAN Belarusi, Minsk, 1999

[24] Sergienko I. V., Kozeratskaya L. N., Lebedeva T. T., Issledovanie ustoichivosti i parametricheskii analiz diskretnykh optimizatsionnykh zadach, Naukova dumka, Kiev, 1995 | Zbl

[25] Emelichev V. A., Girlich E., Nikulin Yu. V., Podkopaev D. P., “Stability and regularization of vector problems of integer linear programming”, Optimization, 51:4 (2002), 645–676 | DOI | MR | Zbl

[26] Emelichev V. A., Stepanishina Yu. V., “Stability of a majority efficient solution of a vector trajectorial problem”, Computer Science J. of Moldova, 7:3 (1999), 291–307 | MR | Zbl

[27] Sotskov Yu. N., Leontev V. K., Gordeev E. N., “Some concepts of stability analysis in combinatorial optimization”, Discrete Appl. Math., 58:2 (1995), 169–190 | DOI | MR | Zbl

[28] Sotskov Yu. N., Tanaev V. S., Werner F., “Stability radius of an optimal schedule: a survey and recent developments”, Industrial applications of combinatorial optimization, Appl. Optim., 16, Kluwer Acad. Publ., Dordrecht, 1998, 72–108 | MR | Zbl