Abstract:
A linear programming method for obtaining separating hyperplanes is discussed. Depending upon the objective function, the algorithm will accept any separating hyperplane ...Show MoreMetadata
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.
Published in: IEEE Transactions on Systems, Man, and Cybernetics ( Volume: SMC-1, Issue: 1, January 1971)