HOW TO SOLVE LINEAR INEQUALITIES
CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER
Pagination or Media Count:
This paper is an attempt to solve the following constrained minimum problem To present the most easily described algorithm for solving linear inequalities subject to the constraints, 1 The algorithm must be efficient. 2 It must be shown to terminate. The algorithm is a variant of the lexicographic simplex method which avoids using any artificial objective function.
- Theoretical Mathematics
- Operations Research