Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Litvinchev I. S., “Metod razlozheniya dlya zadach optimizatsii, ne obladayuschikh blochno-separabelnoi strukturoi”, Zh. vychisl. matem. i matem. fiz., 27:3 (1987), 332–339 | MR | Zbl
[2] Litvinchev I. S., “Dekompozitsiya dlya neseparabelnykh ekstremalnykh zadach”, Dokl. AN SSSR, 292:1 (1987), 33–36 | MR
[3] Tsurkov V. I., Dekompozitsiya v zadachakh bolshoi razmernosti, Nauka, M., 1981 | MR
[4] Mednitskii V. G., “Ob optimalnosti agregirovaniya v blochnoi zadache lineinogo programmirovaniya”, Matem. metody resheniya ekonomich. zadach, 3, Nauka, M., 1972, 13–21
[5] Vasilev F. P., Chislennye metody resheniya ekstremalnykh zadach, Nauka, M., 1988 | MR
[6] Polyak B. T., “Skhodimost metodov vozmozhnykh napravlenii v ekstremalnykh zadachakh”, Zh. vychisl. matem. i matem. fiz., 11:4 (1971), 855–869
[7] Pervozvanskii A. A., Gaitsgori V. G., Dekompozitsiya, agregirovanie, priblizhennaya optimizatsiya, Nauka, M., 1979 | MR