  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 which allows us to use Gaussian elimination to decide
solvability of systems of linear inequalities, for bounded systems.
