Voir la notice de l'article provenant de la source Math-Net.Ru
@article{IVM_2007_6_a1, author = {V. P. Bulatov and T. I. Belykh}, title = {Numerical solution methods for multiextremal problems connected with inverse problems in mathematical programming}, journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika}, pages = {14--20}, publisher = {mathdoc}, number = {6}, year = {2007}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/IVM_2007_6_a1/} }
TY - JOUR AU - V. P. Bulatov AU - T. I. Belykh TI - Numerical solution methods for multiextremal problems connected with inverse problems in mathematical programming JO - Izvestiâ vysših učebnyh zavedenij. Matematika PY - 2007 SP - 14 EP - 20 IS - 6 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/IVM_2007_6_a1/ LA - ru ID - IVM_2007_6_a1 ER -
%0 Journal Article %A V. P. Bulatov %A T. I. Belykh %T Numerical solution methods for multiextremal problems connected with inverse problems in mathematical programming %J Izvestiâ vysših učebnyh zavedenij. Matematika %D 2007 %P 14-20 %N 6 %I mathdoc %U http://geodesic.mathdoc.fr/item/IVM_2007_6_a1/ %G ru %F IVM_2007_6_a1
V. P. Bulatov; T. I. Belykh. Numerical solution methods for multiextremal problems connected with inverse problems in mathematical programming. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 6 (2007), pp. 14-20. http://geodesic.mathdoc.fr/item/IVM_2007_6_a1/
[1] Antipin A. S., “Obratnye zadachi optimizatsii: postanovka zadachi i podkhody k resheniyu”, Obratnye zadachi matematicheskogo programmirovaniya, Izd-vo VTs RAN, M., 1992, 3–33
[2] Levitin E. S., “Zadachi matematicheskogo programmirovaniya pri nalichii ogranichenii ekstremalnogo tipa”, Obratnye zadachi matematicheskogo programmirovaniya, Izd-vo VTs RAN, M., 1992, 102–132
[3] Bulatov V. P., Metody pogruzheniya v zadachakh optimizatsii, Nauka, Novosibirsk, 1977, 158 pp. | MR | Zbl
[4] Bulatov V. P., “Metody resheniya mnogoekstremalnykh zadach”, Metody chislennogo analiza i optmizatsii, Nauka, Novosibirsk, 1987, 133–157 | MR
[5] Bulatov V. P., Khamisov O. V., “The branch and bound method with cuts in $E^{n+1}$ for solving concave programming problem”, Lecture Notes in Control and Informat. Sci., 180, 1992, 273–281 | MR | Zbl