Title :
On Obtaining Separating Hyperplanes via Linear Programming
Author_Institution :
IBM Corp., Westlake Village, Calif. 91360
Abstract :
A linear programming method for obtaining separating hyperplanes is discussed. Depending upon the objective function, the algorithm will accept any separating hyperplane or one which satisfies a minimum distance criterion. Application to inconsistent, i.e., linearly nonseparable, systems is considered.
Keywords :
Constraint theory; Distributed computing; Equations; Linear programming; Radio frequency; Statistics; Timing; Upper bound; Vectors;
Journal_Title :
Systems, Man and Cybernetics, IEEE Transactions on
DOI :
10.1109/TSMC.1971.5408612
