This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Algorithm for the Optimal Solution of Linear Inequalities and its Application to Pattern Recognition
December 1973 (vol. 22 no. 12)
pp. 1065-1075
R.E. Warmack, Research and Development Department, Atlantic Richfield Company
An algorithm for the optimal solution of consistent and inconsistent linear inequalities is presented, where the optimality criterion is the maximization of the number of satisfied constraints. The algorithm is developed as a nonenumerative search procedure based on two new theorems established in this paper. It is shown that the number of iterative steps before termination is strictly less than that required by an exhaustive search. Experimental results with various types of data establish the computational tractability of the procedure under nontrivial conditions.
Index Terms:
Algorithms, linear inequalities, mathematical programming, optimal algorithms, pattern recognition, threshold logic.
Citation:
R.E. Warmack, R.C. Gonzalez, "An Algorithm for the Optimal Solution of Linear Inequalities and its Application to Pattern Recognition," IEEE Transactions on Computers, vol. 22, no. 12, pp. 1065-1075, Dec. 1973, doi:10.1109/T-C.1973.223652
Usage of this product signifies your acceptance of the Terms of Use.