Geodesic
Solution of convex programming problems with linear constraints by the method of successive refinement of the permissible vector
Doklady Akademii Nauk, Tome 150 (1963) no. 2, pp. 231-234.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DAN_1963_150_2_a0,
     author = {V. A. Bulavskii and G. Sh. Rubinshtein},
     title = {Solution of convex programming problems with linear constraints by the method of successive refinement of the permissible vector},
     journal = {Doklady Akademii Nauk},
     pages = {231--234},
     publisher = {mathdoc},
     volume = {150},
     number = {2},
     year = {1963},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1963_150_2_a0/}
}
TY  - JOUR
AU  - V. A. Bulavskii
AU  - G. Sh. Rubinshtein
TI  - Solution of convex programming problems with linear constraints by the method of successive refinement of the permissible vector
JO  - Doklady Akademii Nauk
PY  - 1963
SP  - 231
EP  - 234
VL  - 150
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1963_150_2_a0/
LA  - ru
ID  - DAN_1963_150_2_a0
ER  - 
%0 Journal Article
%A V. A. Bulavskii
%A G. Sh. Rubinshtein
%T Solution of convex programming problems with linear constraints by the method of successive refinement of the permissible vector
%J Doklady Akademii Nauk
%D 1963
%P 231-234
%V 150
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1963_150_2_a0/
%G ru
%F DAN_1963_150_2_a0
V. A. Bulavskii; G. Sh. Rubinshtein. Solution of convex programming problems with linear constraints by the method of successive refinement of the permissible vector. Doklady Akademii Nauk, Tome 150 (1963) no. 2, pp. 231-234. http://geodesic.mathdoc.fr/item/DAN_1963_150_2_a0/