Degree
Master of Science
Program
Computer Science
Supervisor
Moreno Maza, Marc
Abstract
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.
Recommended Citation
Talaashrafi, Delaram, "Complexity Results for Fourier-Motzkin Elimination" (2018). Electronic Thesis and Dissertation Repository. 5981.
https://ir.lib.uwo.ca/etd/5981