@article{IIGUM_2011_4_2_a0,
author = {O. V. Khamisov},
title = {Development optimization methods in investigations of {V.} {P.~Bulatov}},
journal = {The Bulletin of Irkutsk State University. Series Mathematics},
pages = {6--15},
year = {2011},
volume = {4},
number = {2},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/IIGUM_2011_4_2_a0/}
}
O. V. Khamisov. Development optimization methods in investigations of V. P. Bulatov. The Bulletin of Irkutsk State University. Series Mathematics, Tome 4 (2011) no. 2, pp. 6-15. http://geodesic.mathdoc.fr/item/IIGUM_2011_4_2_a0/
[1] V. P. Bulatov, “O nekotorykh metodakh approksimatsii dlya zadach vypuklogo programmirovaniya”, Metody matematicheskogo modelirovaniya v energetike, SEI, Irkutsk, 1966
[2] V. P. Bulatov, Metod approksimatsii pri reshenii nekotorykh ekstremalnykh zadach, Avtoref. dis. ... kand. fiz.-mat. nauk, TGU, Tomsk, 1967
[3] V. P. Bulatov, “Metod approksimatsii dlya resheniya nekotorykh zadach matematicheskogo programmirovaniya”, Priklad. matematika, IGU, Irkutsk, 1969, 82–88
[4] V. P. Bulatov, Metody pogruzheniya v zadachakh optimizatsii, Nauka, Novosibirsk, 1977 | MR | Zbl
[5] V. P. Bulatov, L. I. Kasinskaya, “Ob odnoi interpretatsii metoda Kh. Tuya resheniya zadach vognutogo programmirovaniya”, Priklad. matematika, SEI, Irkutsk, 1978, 206–208
[6] I. A. Aleksandrov, E. G. Antsiferov, V. P. Bulatov, “K metodam tsentrirovannykh sechenii”, Tez. dokl. konf. po mat. programmirovaniyu, Sverdlovsk, 1981, 72–73
[7] V. P. Bulatov, L. I. Kasinskaya, “Nekotorye metody minimizatsii vognutoi funktsii na vypuklom mnogogrannike”, Metody optimizatsii i ikh prilozheniya, Novosibirsk, Nauka, 1982, 71–80 | MR | Zbl
[8] V. P. Bulatov, I. O. Shepotko, “Metod tsentrov tyazhesti ortogonalnykh simpleksov dlya resheniya zadachi vypuklogo programmirovaniya”, Metody optimizatsii i ikh prilozheniya, SEI, Irkutsk, 1982, 79–86 | MR
[9] L. T. Aschepkov, B. I. Belov, V. P. Bulatov, O. V. Vasilev, V. A. Srochko, N. V. Tarasenko, Metody resheniya zadach matematicheskogo programmirovaniya i optimalnogo upravleniya, Nauka, Novosibirsk, 1984, 233 pp. | MR
[10] E. G. Antsiferov, V. P. Bulatov, “Algoritm simpleksnykh pogruzhenii v vypuklom programmirovanii”, Zhurn. vychisl. matematiki i mat. fiziki, 27:3 (1984), 348–385 | MR
[11] V. P. Bulatov, “Globalnaya optimizatsiya i chislennye metody poiska vsekh reshenii sistem nelineinykh algebraicheskikh uravnenii”, Zhurn. vychisl. matematiki i mat. fiziki, 40:3 (2000), 348–355 | MR | Zbl
[12] V. P. Bulatov, T. I. Belykh, “Vognutoe programmirovanie i chislennye metody poiska veschestvennykh reshenii nelineinykh sistem”, Dokl. RAN, 376:2 (2001), 171–174 | MR
[13] T. I. Belykh, V. P. Bulatov, “Ob odnom metode simpleksnykh pogruzhenii v vypuklom programmirovanii”, Dokl. RAN, 376:3 (2001), 315–317 | MR
[14] V. P. Bulatov, “Obratnye zadachi matematicheskogo programmirovaniya. Metody globalnoi optimizatsii”, Dokl. RAN, 376:4 (2001), 461–464 | MR
[15] V. P. Bulatov, N. I. Fedurina, “Ob odnom effektivnom metode vypuklogo programmirovaniya”, Diskret. analiz i issled. operatsii. Ser. 2, 11:1 (2004), 51–61 | MR | Zbl
[16] V. P. Bulatov, T. I. Belykh, “Globalnaya optimizatsiya i metody nakhozhdeniya vsekh kornei sistem nelineinykh algebraicheskikh uravnenii”, Diskret. analiz i issled. operatsii. Ser. 2, 13:1 (2006), 3–9 | MR | Zbl
[17] V. P. Bulatov, T. I. Belykh, “Chislennye metody resheniya mnogoekstremalnykh zadach, svyazannykh s obratnymi zadachami matematicheskogo programmirovaniya”, Izv. vuzov. Matematika, 2007, no. 12, 14–20 | MR | Zbl
[18] V. P. Bulatov, O. V. Khamisov, “Metody otsechenii v $E^{n+1}$ dlya resheniya zadach globalnoi optimizatsii na odnom klasse funktsii”, Zhurn. vychisl. matematiki i mat. fiziki, 47:11 (2007), 1830–1842 | MR
[19] T. I. Belykh, V. P. Bulatov, E. N. Yaskova, “Metody chebyshevskikh tochek vypuklykh mnozhestv i ikh prilozheniya”, Zhurn. vychisl. matematiki i mat. fiziki, 48:1 (2008), 18–32 | MR | Zbl
[20] V. P. Bulatov, “Metod ortogonalnykh simpleksov i ego prilozheniya v vypuklom programmirovanii”, Zhurn. vychisl. matematiki i mat. fiziki, 48:4 (2008), 610–622 | MR | Zbl
[21] T. I. Belykh, V. P. Bulatov, “Metody opornykh konusov i simpleksov v vypuklom programmirovanii i ikh prilozheniya v nekotorykh fiziko-khimicheskikh sistemakh”, Zhurn. vychisl. matematiki i mat. fiziki, 48:11 (2008), 1952–1967 | MR
[22] V. P. Bulatov, T. I. Belykh, E. N. Yaskova, “Effektivnye metody resheniya zadach vypuklogo programmirovaniya, ispolzuyuschie pogruzhenie dopustimogo mnozhestva v simpleksy”, Diskret. analiz i issled. operatsii, 15:3 (2008), 3–10 | MR | Zbl
[23] V. P. Bulatov, “Methods for solving multi-extremal problems (global search)”, Annals of Operations Research, 25:1 (1990), 253–277 | DOI | MR
[24] V. P. Bulatov, O. V. Khamisov, “The Branch and Bound Method with Cuts in $E^{n+1}$ for Solving Concave Programming Problem”, Lecture Notes in Control and Information Sciences, 180, 1992, 273–281 | DOI | MR | Zbl
[25] V. P. Bulatov, “New Effective Methods of Mathematical Programming and Their Application to Energy Problems”, Optimization in the Energy Industry, 180 (1992), 273–281 | MR | Zbl
[26] J. E. Kelley, “The Cutting Plane Method for Solving Convex Programs”, SIAM J. Industrial and Applied Mathematics, 8 (1960), 703–712 | DOI | MR
[27] D. M. Topkis, “Cutting plane methods without nested constraint set”, Operations Research, 1970, no. 3 | MR