The dependency diagram of a linearprogramme

The Dependency Diagram of a Linear Programme (LP) shows how the successive inequalities of an LP depend on former inequalities, when variables are projected out by Fourier-Motzkin Elimination. It is also explained how redundant inequalities can be removed, using the method attributed to Chernikov and to Kohler. The procedure also leads to a transparent explanation of Farkas' Lemma, LP Duality, the dual form of Caratheodory's Theorem as well as generating all vertices and extreme rays of the Dual Polytope.