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...

We generalise polyhedral projection (Fourier-Motzkin elimination) to integer programming (IP) and derive from this an alternative perspective on IP that parallels the classical theory. We first observe that projection of an IP yields an IP augmented with linear congruence relations and...

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. This is explained in a paper referenced below. The paper, given here, extends the results to the Mixed...

We give a general method of finding the optimal objective, and solution, values of a Mixed Integer Linear Programme over a Cone (MILPC) as a function of the coefficients (objective, matrix and right- hand side). In order to do this we first convert the matrix of constraint coefficients to a...