Letter to the Editor—A Note on Pattern Separation

This note describes a linear programming method of separating two, not necessarily disjoint convex polyhedral sets in Eⁿ. If the sets are disjoint, a strictly separating hyperplane is generated that maximizes and equalizes the distance between the sets and the hyperplane. If the sets intersect a hyperplane is generated that minimizes the maximum error.