Solution of Linear Inequalities
- 1 February 1970
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-19 (2) , 124-131
- https://doi.org/10.1109/t-c.1970.222877
Abstract
A method for solving systems of linear inequalities, consistent and inconsistent, corresponding to the separable and nonseparable cases in pattern recognition is presented. Attempts are made to evaluate the speed and efficiency of the algorithm. It seems to compare in speed with the best algorithms for consistent systems of inequalities in the consistent case and retains remarkable speed in the inconsistent case. There are indications that in many cases it may be relied on to find a complete solution if several runs are taken, most runs achieving a nearly complete solution. The experimental evidence suggests that this is the most efficient and powerful method currently available for finding a solution which satisfies as many cases as possible in a set of linear inequalities.Keywords
This publication has 8 references indexed in Scilit:
- State of the art in pattern recognitionProceedings of the IEEE, 1968
- Pattern Classifier Design by Linear ProgrammingIEEE Transactions on Computers, 1968
- On pattern classification algorithms introduction and surveyProceedings of the IEEE, 1968
- Perceptron type learning algorithms in nonseparable situationsJournal of Mathematical Analysis and Applications, 1967
- Pattern Classification by Iteratively Determined Linear and Piecewise Linear Discriminant FunctionsIEEE Transactions on Electronic Computers, 1966
- A Class of Iterative Procedures for Linear InequalitiesSIAM Journal on Control, 1966
- Linear and Nonlinear Separation of Patterns by Linear ProgrammingOperations Research, 1965
- Linear Decision Functions, with Application to Pattern RecognitionProceedings of the IRE, 1962