Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Yudin D. B., Tsoi E. V., “Tselochislennoe stokhasticheskoe programmirovanie”, Izv. AN SSSR. Tekhn. kibernetika, 1974, no. 1, 3–11 | Zbl
[2] Tsurkov V. I., “Dvukhetapnaya zadacha stokhasticheskogo programmirovaniya blochnogo tipa”, Zh. vychisl. matem. i matem. fiz., 18:2 (1978), 360–369 | MR | Zbl
[3] Tsurkov V. I., “Metod dekompozitsii na osnove agregirovaniya v blochnom programmirovanii”, Zh. vychisl. matem. i matem. fiz., 19:2 (1979), 343–355 | MR
[4] Lyapunov A. A., “O vpolne additivnykh vektor-funktsiyakh”, Izv. AN SSSR. Ser. matem., 4:6 (1940), 465–478
[5] Rokafellar R. T., Vypuklyi analiz, Nauka, M., 1973
[6] Averbakh I. L., Veroyatnostnye svoistva dvoistvennoi struktury zadach bulevogo lineinogo programmirovaniya, Dep. v VINITI 28.08.87, No 6369-V87, 15 pp.
[7] Lesdon L. S., Optimizatsiya bolshikh sistem, Mir, M., 1975
[8] Ulm S. Yu., Metody dekompozitsii dlya resheniya zadach optimizatsii, Valgus, Tallin, 1979