Analysis of the problem of $h$-polyhedral separability of two sets

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.