A theorem on separability of a convex polyhedron from zero point of the space and its applications in optimization
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (2006), pp. 21-26
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Vasilev F. P., Chislennye metody resheniya ekstremalnykh zadach, Nauka, M., 1980, 518 pp. | MR
[2] Demyanov V. F., Malozemov V. N., Vvedenie v minimaks, Nauka, M., 1972, 368 pp. | MR
[3] Pshenichnyi B. N., Vypuklyi analiz i ekstremalnye zadachi, Nauka, M., 1980, 319 pp. | MR | Zbl
[4] Sukharev A. G., Timokhov A. V., Fedorov V. V., Kurs metodov optimizatsii, Nauka, M., 1986, 328 pp. | MR | Zbl
[5] Karmanov V. G., Matematicheskoe programmirovanie, Nauka, M., 1986, 286 pp. | MR
[6] Rekleitis G., Reinvindran A., Regsdel K., Optimizatsiya v tekhnike, Ch. II, Nauka, M., 1986, 320 pp.