Combinatorial properties of Fourier-Motzkin elimination
Combinatorial properties of Fourier-Motzkin elimination
Fourier-Motzkin elimination is a classical method for solving linear inequalities inwhich one variable is eliminated in each iteration. This method is considered here as a matrixoperation and properties of this operation are established. In particular, the focus is on situationswhere this matrix operation preserves combinatorial matrices (defined here as (0, …