On the problem polyhedral separability: a numerical solution

Using the piecewise-linear function, consideration was given to the problem of separation of the sets whose convex hulls have nonempty intersections. For the problem of polyhedral separability, an algorithm to solve the equivalent optimization problem of seeking the family of separating hyperplanes was proposed and substantiated. Its efficiency was demonstrated by way of a numerical experiment.

Presented by the member of Editorial Board: A. A. Lazarev