EXTENSIONS OF A THEOREM BY CLARK
NORTHWESTERN UNIV EVANSTON IL TECHNOLOGICAL INST
Pagination or Media Count:
IF A LINEAR PROGRAMMING PROBLEM written in inequality form has a solution, then either the primal constraint set or the dual constraint set is unbounded. The parenthetical remark is our addition to he statement of the theorem, but is implicitly assumed. The inequality form of the general linear programming problem is s metimes referred to as the canonical form and used as a standard point of departure for further analyses. Yet some care may be needed, as is true here, ifA FULL DEGREE OF GENERALITY AND UNDERSTANDING IS TO BE ACHIEVED.
- Theoretical Mathematics