Solving Systems of Linear Inequalities
share
Dantzig and Eaves claimed that fundamental duality theorems of linear programming were a trivial consequence of Fourier elimination. Another property of Fourier elimination is considered here, regarding the existence of implicit equalities rather than solvability. This leads to a different interpretation of duality theory and to a simple algorithm to determine if a system is solvable, in the bounded case or in the full dimensional case.
READ FULL TEXT