|
Vestnik Sankt-Peterburgskogo Universiteta. Seriya 10. Prikladnaya Matematika. Informatika. Protsessy Upravleniya, 2012, Issue 4, Pages 85–91
(Mi vspui97)
|
|
|
|
Applied mathematics
Analysis of the problem of $h$-polyhedral separability of two sets
E. K. Cherneutsanu St. Petersburg State University
Abstract:
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.
Accepted: June 21, 2012
Citation:
E. K. Cherneutsanu, “Analysis of the problem of $h$-polyhedral separability of two sets”, Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr., 2012, no. 4, 85–91
Linking options:
https://www.mathnet.ru/eng/vspui97 https://www.mathnet.ru/eng/vspui/y2012/i4/p85
|
|