Geodesic
Problems of mathematical programming which have a minimal point
Doklady Akademii Nauk, Tome 183 (1968) no. 1, pp. 15-17 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{DAN_1968_183_1_a2,
     author = {V. Z. Belen'kii},
     title = {Problems of mathematical programming which have a minimal point},
     journal = {Doklady Akademii Nauk},
     pages = {15--17},
     year = {1968},
     volume = {183},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1968_183_1_a2/}
}
TY  - JOUR
AU  - V. Z. Belen'kii
TI  - Problems of mathematical programming which have a minimal point
JO  - Doklady Akademii Nauk
PY  - 1968
SP  - 15
EP  - 17
VL  - 183
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/DAN_1968_183_1_a2/
LA  - ru
ID  - DAN_1968_183_1_a2
ER  - 
%0 Journal Article
%A V. Z. Belen'kii
%T Problems of mathematical programming which have a minimal point
%J Doklady Akademii Nauk
%D 1968
%P 15-17
%V 183
%N 1
%U http://geodesic.mathdoc.fr/item/DAN_1968_183_1_a2/
%G ru
%F DAN_1968_183_1_a2
V. Z. Belen'kii. Problems of mathematical programming which have a minimal point. Doklady Akademii Nauk, Tome 183 (1968) no. 1, pp. 15-17. http://geodesic.mathdoc.fr/item/DAN_1968_183_1_a2/