Geodesic
Stability radius bounds for the lexicographic optimum of the vector Boolean problem with Savage's risk criteria
Diskretnyj analiz i issledovanie operacij, Tome 18 (2011) no. 2, pp. 41-50.

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

We consider a lexicographic Boolean problem of building an investor's portfolio of assets. The goal is to minimize risks using Savage's “bottleneck” (the worst-case regret) criteria. We obtained lower and upper attainable bounds for the stability radius of the lexicographic optimum of the problem in the case with octahedral metric $l_1$ in the portfolios space and Chebyshev metric $l_\infty$ in the risk and financial market conditions space. Bibliogr. 12.
Keywords: vector boolean problem, portfolio optimization, mimimax problem, lexicographic optimum, Savage's risk criteria, stability radius.
Mots-clés : perturbation matrix 
@article{DA_2011_18_2_a3,
     author = {V. A. Emelichev and V. V. Korotkov},
     title = {Stability radius bounds for the lexicographic optimum of the vector {Boolean} problem with {Savage's} risk criteria},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {41--50},
     publisher = {mathdoc},
     volume = {18},
     number = {2},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2011_18_2_a3/}
}
TY  - JOUR
AU  - V. A. Emelichev
AU  - V. V. Korotkov
TI  - Stability radius bounds for the lexicographic optimum of the vector Boolean problem with Savage's risk criteria
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2011
SP  - 41
EP  - 50
VL  - 18
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2011_18_2_a3/
LA  - ru
ID  - DA_2011_18_2_a3
ER  - 
%0 Journal Article
%A V. A. Emelichev
%A V. V. Korotkov
%T Stability radius bounds for the lexicographic optimum of the vector Boolean problem with Savage's risk criteria
%J Diskretnyj analiz i issledovanie operacij
%D 2011
%P 41-50
%V 18
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2011_18_2_a3/
%G ru
%F DA_2011_18_2_a3
V. A. Emelichev; V. V. Korotkov. Stability radius bounds for the lexicographic optimum of the vector Boolean problem with Savage's risk criteria. Diskretnyj analiz i issledovanie operacij, Tome 18 (2011) no. 2, pp. 41-50. http://geodesic.mathdoc.fr/item/DA_2011_18_2_a3/

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

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

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

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

[5] Emelichev V. A., Karelkina O. V., “Konechnye koalitsionnye igry: parametrizatsiya kontseptsii ravnovesiya (ot Pareto do Nesha) i ustoichivost effektivnoi situatsii v metrike Gëldera”, Diskret. matematika, 21:2 (2009), 43–50 | MR

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

[7] Emelichev V. A., Korotkov V. V., “O radiuse kvaziustoichivosti vektornoi bulevoi zadachi s kriteriyami Sevidzha”, Vseros. konferentsiya “Diskretnaya optimizatsiya i issledovanie operatsii” (Altai, 27 iyunya – 3 iyulya 2010 g.), Materialy konferentsii, Izd-vo In-ta matematiki, Novosibirsk, 2010, 113

[8] Emelichev V. A., Kuzmin K. G., “Obschii podkhod k issledovaniyu ustoichivosti pareto-optimalnogo resheniya vektornoi zadachi tselochislennogo lineinogo programmirovaniya”, Diskret. matematika, 19:3 (2007), 79–83 | MR | Zbl

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

[10] Emelichev V. A., Kuzmin K. G., “O radiuse ustoichivosti vektornoi zadachi tselochislennogo lineinogo programmirovaniya v sluchae regulyarnosti normy v kriterialnom prostranstve”, Kibernetika i sistem. analiz, 2010, no. 1, 82–89 | MR | Zbl

[11] Markowitz H. M., Portfolio selection: efficient diversification of investments, Blackwell Publ., Oxford, 1991, 310 pp.

[12] Savage L. J., The foundations of statistics, Dover Publ., New York, 1972, 384 pp. | MR | Zbl