IEEE Transactions on Computers · 1973 · 54 citations · 12 references
ComputingComputer ScienceAlgorithmsOptimizationTheory Of ComputationConstrained OptimizationConstraint SatisfactionLinear ProgrammingOptimization TheoryPattern RecognitionSearching AlgorithmsConstraint OptimizationConstraint Optimization ProblemsConstraint Satisfaction SearchConstraintsLinear ConstraintsOptimality Conditions
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.
12
Introduction to Approximation Theory
T. J. Rivlin, E. W. Cheney · Mathematics of Computation · 1969 · 2.1K citations
Pattern Classifier Design by Linear Programming
Fred W. Smith · IEEE Transactions on Computers · 1968 · 147 citations