By Topic

On Obtaining Separating Hyperplanes via Linear Programming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
W. C. Martin ; IBM Corp., Westlake Village, Calif. 91360

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 )