Geodesic
Analysis of the sensitivity of efficient solutions of a vector problem of minimizing linear forms on a set of permutations
Diskretnaya Matematika, Tome 12 (2000) no. 3, pp. 37-48.

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

We consider a multicriteria formulation of the well-known combinatorial problem to minimise a linear form over an arbitrary set of permutations of the symmetric group. We give bounds (in the Chebyshev metric) for the coefficients of the linear forms preserving the corresponding efficiency of an arbitrary solution that is Pareto-, Slater-, or Smale-optimal. We present some conditions guaranteeing that a permutation possessing the efficiency property is locally stable. The class of quasi-stable problems is described. 
@article{DM_2000_12_3_a1,
     author = {V. A. Emelichev and V. G. Pokhil'ko},
     title = {Analysis of the sensitivity of efficient solutions of a vector problem of minimizing linear forms on a set of permutations},
     journal = {Diskretnaya Matematika},
     pages = {37--48},
     publisher = {mathdoc},
     volume = {12},
     number = {3},
     year = {2000},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2000_12_3_a1/}
}
TY  - JOUR
AU  - V. A. Emelichev
AU  - V. G. Pokhil'ko
TI  - Analysis of the sensitivity of efficient solutions of a vector problem of minimizing linear forms on a set of permutations
JO  - Diskretnaya Matematika
PY  - 2000
SP  - 37
EP  - 48
VL  - 12
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2000_12_3_a1/
LA  - ru
ID  - DM_2000_12_3_a1
ER  - 
%0 Journal Article
%A V. A. Emelichev
%A V. G. Pokhil'ko
%T Analysis of the sensitivity of efficient solutions of a vector problem of minimizing linear forms on a set of permutations
%J Diskretnaya Matematika
%D 2000
%P 37-48
%V 12
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2000_12_3_a1/
%G ru
%F DM_2000_12_3_a1
V. A. Emelichev; V. G. Pokhil'ko. Analysis of the sensitivity of efficient solutions of a vector problem of minimizing linear forms on a set of permutations. Diskretnaya Matematika, Tome 12 (2000) no. 3, pp. 37-48. http://geodesic.mathdoc.fr/item/DM_2000_12_3_a1/

[1] Podinovskii V. V., Nogin V. D., Pareto-optimalnye resheniya mnogokriterialnykh zadach, Nauka, Moskva, 1982 | MR | Zbl

[2] Танаев В. С., Шкурба В. В. Vvedenie v teoriyu raspisanii, Nauka, Moskva, 1975 | MR

[3] Tanaev V. S., Gordon V. S., Shafranskii Ya. M., Teoriya raspisanii. Odnostadiinye sistemy, Nauka, Moskva, 1984 | MR | Zbl

[4] Emelichev V. A., Suprunenko D. A., Tanaev V. S., “O rabote belorusskikh matematikov v oblasti diskretnoi optimizatsii”, Izvestiya AN SSSR. Tekhnicheskaya kibernetika, 1982, no. 6, 25–45 | MR | Zbl

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

[6] Leontev V. K., “Ustoichivost v lineinykh diskretnykh zadachakh”, Probl. kibernetiki, 35 (1979), 169–184 | MR

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

[8] Emelichev V. A., Kravtsov M. K., Podkopaev D. P., “O kvaziustoichivosti traektornykh zadach vektornoi optimizatsii.”, Matem. zametki, 63:1 (1998), 21–27 | MR | Zbl

[9] Emelichev V. A., Podkopaev D. P., “O kolichestvennoi mere ustoichivosti vektornoi zadachi tselochislennogo programmirovaniya”, Zhurnal vychisl. matem. i matem. fiziki, 38:11 (1998), 1801–1805 | MR | Zbl

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

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

[12] Molodtsov D. A., Ustoichivost printsipov optimalnosti, Nauka, Moskva, 1987 | MR | Zbl

[13] Belousov E. G., Andronov V. G., Razreshimost i ustoichivost zadach polinomialnogo programmirovaniya, Izd. MGU, Moskva, 1993 | MR | Zbl

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

[15] Emelichev V. A., Pokhilko V. G., “Radius kvaziustoichivosti mnozhestva Pareto vektornoi zadachi minimizatsii lineinykh form na mnozhestve podstanovok”, Vestnik Belorus. un-ta, Ser. I, 1999, no. 3, 45–47 | MR | Zbl