Geodesic
Fej\'er methods for the strong separability of convex polyhedral sets
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (2006), pp. 33-43.

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

@article{IVM_2006_12_a3,
     author = {I. I. Eremin},
     title = {Fej\'er methods for the strong separability of convex polyhedral sets},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {33--43},
     publisher = {mathdoc},
     number = {12},
     year = {2006},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_2006_12_a3/}
}
TY  - JOUR
AU  - I. I. Eremin
TI  - Fej\'er methods for the strong separability of convex polyhedral sets
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 2006
SP  - 33
EP  - 43
IS  - 12
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_2006_12_a3/
LA  - ru
ID  - IVM_2006_12_a3
ER  - 
%0 Journal Article
%A I. I. Eremin
%T Fej\'er methods for the strong separability of convex polyhedral sets
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 2006
%P 33-43
%N 12
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_2006_12_a3/
%G ru
%F IVM_2006_12_a3
I. I. Eremin. Fej\'er methods for the strong separability of convex polyhedral sets. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (2006), pp. 33-43. http://geodesic.mathdoc.fr/item/IVM_2006_12_a3/

[1] Chernikov S. N., Lineinye neravenstva, Nauka, M., 1968, 488 pp. | MR | Zbl

[2] Eremin I. I., Teoriya lineinoi optimizatsii, Izd-vo “Ekaterinburg”, Ekaterinburg, 1999, 312 pp.

[3] K.-Kh. Elster (red.), Vvedenie v nelineinoe programmirovanie, Nauka, M., 1985, 264 pp. | MR