Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Shmyrev V. I., “Ob odnom podkhode k otyskaniyu ravnovesiya v prosteishikh modelyakh obmena”, Dokl. AN SSSR, 268:5 (1983), 1062–1066 | MR | Zbl
[2] Eaves B. C., “A finite algorithm for the linear exchangemodel”, J. Math. Econom., 3:2 (1976), 197–204 | DOI | MR
[3] Lemke C. E., “Bimatrix equilibrium points and math. programming”, Manag. Sci., 2:7 (1965), 681–689 | DOI | MR
[4] Shmyrev V. I., Shmyreva N. V., “An iterative algorithm for searching an equilibrium in the linear exchange model”, Siberian Adv. Math., 6:1 (1996), 87–104 | MR
[5] Shmyrev V. I., “Algoritmy otyskaniya ravnovesiya v modelyakh obmena s fiksirovannymi byudzhetami”, Optimizatsiya, 1983, no. 31(48), 137–155 | MR | Zbl
[6] Shmyrev V. I., “An algorithmic approach for searching an equilibrium in fixed budget exchange models”, Russian Contributions to Game Theory and Eqilibrium Theory, Springer–Verlag, Berlin, 2006, 217–235
[7] Golshtein E. G., Yudin D. B., Zadachi transportnogo tipa, Nauka, M., 1969
[8] Gale D., “The linear exchange model”, Math. Econom., 3:2 (1976), 205–209 | DOI | MR | Zbl
[9] Geil D., Teoriya lineinykh ekonomicheskikh modelei, Izd-vo inostr. lit., M., 1963
[10] Shmyrev V. I., “Algoritm poiska ravnovesiya v lineinoi modeli obmena”, Sib. mat. zhurn., 26:2 (1985), 163–175 | MR
[11] Rokafellar R. T., Vypuklyi analiz, Mir, M., 1973
[12] Shmyrev V. I., Vvedenie v matematicheskoe programmirovanie, Izd. In-ta kompyuternykh issledovanii, M., 2002
[13] Rubinshtein G. Sh., Shmyrev V. I., “Metody minimizatsii kvazivypuklykh funktsii na vypuklom mnogogrannike”, Optimizatsiya, 1971, no. 1, 82–117
[14] Dantzig G. B., Cottle R. W., “Positive (semi-)definite programming”, Nonlinear Programming, Noth-Holland, Amsterdam, 1967, 55–73 | MR