Master of Science
Moreno Maza, Marc
In this thesis, we propose a new method for removing all the redundant inequalities generated by Fourier-Motzkin elimination. This method is based on Kohler’s work and an improved version of Balas’ work. Moreover, this method only uses arithmetic operations on matrices. Algebraic complexity estimates and experimental results show that our method outperforms alternative approaches based on linear programming.
Talaashrafi, Delaram, "Complexity Results for Fourier-Motzkin Elimination" (2018). Electronic Thesis and Dissertation Repository. 5981.