Geodesic
Bilinear minimax problems with linear constraints: Theory and numerical
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 33 (1993) no. 6, pp. 837-856 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1993_33_6_a1,
     author = {A. I. Astrovskii and S. K. Korzhenevich},
     title = {Bilinear minimax problems with linear constraints: {Theory} and numerical},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {837--856},
     year = {1993},
     volume = {33},
     number = {6},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_6_a1/}
}
TY  - JOUR
AU  - A. I. Astrovskii
AU  - S. K. Korzhenevich
TI  - Bilinear minimax problems with linear constraints: Theory and numerical
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1993
SP  - 837
EP  - 856
VL  - 33
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_6_a1/
LA  - ru
ID  - ZVMMF_1993_33_6_a1
ER  - 
%0 Journal Article
%A A. I. Astrovskii
%A S. K. Korzhenevich
%T Bilinear minimax problems with linear constraints: Theory and numerical
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1993
%P 837-856
%V 33
%N 6
%U http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_6_a1/
%G ru
%F ZVMMF_1993_33_6_a1
A. I. Astrovskii; S. K. Korzhenevich. Bilinear minimax problems with linear constraints: Theory and numerical. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 33 (1993) no. 6, pp. 837-856. http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_6_a1/

[1] Germeier Yu. B., Igry s neprotivopolozhnymi interesami, Nauka, M., 1976 | MR | Zbl

[2] Astrovskii A. I., “Apriornyi sposob postroeniya garantiruyuschikh operatsii v zadachakh otsenivaniya nachalnogo sostoyaniya”, Dokl. AN BSSR, 31:9 (1987), 795–798 | MR

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

[4] Belenkii A. S., “Nakhozhdenie sedlovykh tochek na vypuklykh mnogogrannikakh v zadachakh minimaksnoi optimizatsii s lineinymi ogranicheniyami”, Avtomatika i telemekhan., 1980, no. 7, 161–167 | MR

[5] Mjelde K. M., “Max-min resource allocation”, BIT, 23 (1983), 529–537 | DOI | MR | Zbl

[6] Mendelson H., Pliskin J. S., Yechiali U., “Optimal storage allocation for serial files”, Communs ACM, 22 (1979), 687–693 | DOI | MR

[7] Astrovskii A. I., Korzhenevich S. K., Issledovanie bilineinykh minimaksnykh zadach: teoriya i vychislitelnyi eksperiment, Preprint No 43(443), In-t matem. AN BSSR, Minsk, 1990

[8] Gabasov P. F., Kirillova F. M., Metody lineinogo programmirovaniya, v. III, Izd-vo BGU, Minsk, 1980 | Zbl

[9] Astrovskii A. I., “Algoritm resheniya bilineinoi minimaksnoi zadachi s lineinymi ogranicheniyami”, Konstruktivnaya teoriya ekstremalnykh zadach, Universitetskoe, Minsk, 1984, 156–172

[10] Astrovskii A. I., Korzhenevich S. K., Metody resheniya obschei bilineinoi minimaksnoi zadachi s lineinymi ogranicheniyami, Preprint No 27(263), In-t matem. AN BSSR, Minsk, 1986

[11] Gantmakher F. R., Teoriya matrits, Nauka, M., 1988 | MR | Zbl

[12] Faddeev D. K., Faddeeva V. N., Vychislitelnye metody lineinoi algebry, Fizmatgiz, M.–L., 1963 | MR | Zbl

[13] Astrovskii A. I., “Reshenie bilineinoi minimaksnoi zadachi s lineinymi ogranicheniyami (MPBLA, DMPBLA)”, Adaptivnaya optimizatsiya-2, Programmnoe obespechenie EVM, 55, In-t matem. AN BSSR, Minsk, 1985, 85–93

[14] R. Gabasov, F. M. Kirillova, A. A. Senko (red.), Adaptivnaya optimizatsiya, Programmnoe obespechenie EVM, 43, In-t matem. AN BSSR, Minsk, 1983

[15] R. Gabasov, F. M. Kirillova, A. V. Pokataev (red.), Adaptivnaya optimizatsiya-2, Programmnoe obespechenie EVM, 55, In-t matem. AN BSSR, Minsk, 1985