Letter to the Editor—A Note on Pattern Separation

Richard C. Grinold
Additional contact information
Richard C. Grinold: University of California, Berkeley, California

Operations Research, 1970, vol. 18, issue 1, 187-190

Abstract: This note describes a linear programming method of separating two, not necessarily disjoint convex polyhedral sets in E n . 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.

Date: 1970
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.18.1.187 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:18:y:1970:i:1:p:187-190

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().