Geodesic
Analysis of the problem of $h$-polyhedral separability of two sets
Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ, no. 4 (2012), pp. 85-91

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

The problem of strict separation of the convex hull of a finite set $ A $ on a finite set $ B $ by using $ h $ of hyperplanes is considered. This problem is reduced to a finite number of linear programming problems.
Keywords: $h$-polyhedral separability, linear programming. 
@article{VSPUI_2012_4_a8,
     author = {E. K. Cherneutsanu},
     title = {Analysis of the problem of $h$-polyhedral separability of two sets},
     journal = {Vestnik Sankt-Peterburgskogo universiteta. Prikladna\^a matematika, informatika, processy upravleni\^a},
     pages = {85--91},
     publisher = {mathdoc},
     number = {4},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VSPUI_2012_4_a8/}
}
TY  - JOUR
AU  - E. K. Cherneutsanu
TI  - Analysis of the problem of $h$-polyhedral separability of two sets
JO  - Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ
PY  - 2012
SP  - 85
EP  - 91
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VSPUI_2012_4_a8/
LA  - ru
ID  - VSPUI_2012_4_a8
ER  - 
%0 Journal Article
%A E. K. Cherneutsanu
%T Analysis of the problem of $h$-polyhedral separability of two sets
%J Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ
%D 2012
%P 85-91
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VSPUI_2012_4_a8/
%G ru
%F VSPUI_2012_4_a8
E. K. Cherneutsanu. Analysis of the problem of $h$-polyhedral separability of two sets. Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ, no. 4 (2012), pp. 85-91. http://geodesic.mathdoc.fr/item/VSPUI_2012_4_a8/