On stability of lexicographical solution of vector minimax quadratic Boolean problem

V. A. Emelichev ; V. V. Korotkov

Trudy Instituta matematiki, Tome 19 (2011) no. 2, pp. 26-36.

Résumé

Lower and upper attainable bounds of the stability radius of a lexicographical optimum of the vector Boolean problem with minimax criteria for quadratic forms.

Bibliographie

[1] Demyanov V.F., Malozemov V.N., Vvedenie v minimaks, M., 1972 | MR

[2] Fedorov V.V., Chislennye metody maksimina, M., 1979

[3] Daskin M.S., Network and discrete location: models, algorithms and applications, New York, 1995 | MR | Zbl

[4] Minimax and applications, eds. Du D.-Z., Pardalos P.M., Dordrecht, 1995 | MR

[5] Sukharev A.G., Minimaksnye algoritmy v zadachakh chislennogo analiza, M., 2009 | Zbl

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

[7] Gordeev E.N., “Ob ustoichivosti zadach na uzkie mesta”, Zhurn. vychisl. matematiki i mat. fiziki, 33:9 (1993), 1391–1402 | MR | Zbl

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

[9] Gordeev E.N., Kalinovskii M.A., “Ob ustoichivosti reshenii v zadachakh vychislitelnoi geometrii”, Kibernetika i sistemnyi analiz, 1999, no. 2, 3–14 | MR | Zbl

[10] Gurevskii E.E., Emelichev V.A., “O pyati tipakh ustoichivosti leksikograficheskogo varianta kombinatornoi zadachi na uzkie mesta”, Diskretnaya matematika, 21:3 (2009), 3–13 | MR

[11] Emelichev V.A., Gurevskii E.E., “O yadre ustoichivosti mnogokriterialnoi kombinatornoi minimaksnoi zadachi”, Diskretnyi analiz i issledovanie operatsii, 15:5 (2008), 6–19 | MR

[12] Emelichev V.A., Kuzmin K.G., “Kriterii ustoichivosti vektornykh kombinatornykh zadach “na uzkie mesta” v terminakh binarnykh otnoshenii”, Kibernetika i sistemnyi analiz, 2008, no. 3, 103–111 | MR | Zbl

[13] Emelichev V.A., Kuzmin K.G., Leonovich A.M., “Ustoichivost v vektornykh kombinatornykh zadachakh optimizatsii”, Avtomatika i telemekhanika, 2004, no. 2, 79–92 | MR | Zbl

[14] Savage L.J., The foundations of statistics, New York, 1972 | MR

[15] Emelichev V.A., Korotkov V.V., “Ob ustoichivosti effektivnogo resheniya vektornoi investitsionnoi bulevoi zadachi s minimaksnymi kriteriyami Sevidzha”, Tr. In-ta matematiki NAN Belarusi, 18:2 (2010), 3–10 | MR | Zbl

[16] Emelichev V.A., Korotkov V.V., “Otsenki radiusa ustoichivosti leksikograficheskogo optimuma vektornoi bulevoi zadachi s kriteriyami riskov Sevidzha”, Diskretnyi analiz i issledovanie operatsii, 18:2 (2011), 41–50 | MR

[17] Markowitz H.M., Portfolio selection: efficient diversification of investments, Oxford, 1991

[18] Emelichev V.A., Karpuk A.V., Kuzmin K.G., “O kvaziustoichivosti leksikograficheskoi minimaksnoi kombinatornoi zadachi c raspadayuschimisya peremennymi”, Diskretnyi analiz i issledovanie operatsii, 17:3 (2010), 32–45 | MR

[19] Gurevskii E.E., Emelichev V.A., “Mera ustoichivosti leksikograficheskogo optimuma vektornoi zadachi tselochislennogo lineinogo programmirovaniya v sluchae normy Gëldera”, Vestnik BGU. Ser. 1, 2007, no. 1, 111–113

[20] Emelichev V.A., Kuzmin K.G., “O radiuse ustoichivosti leksikograficheskogo optimuma odnoi vektornoi zadachi buleva programmirovaniya”, Kibernetika i sistemnyi analiz, 2005, no. 2, 71–81 | MR | Zbl

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