ACO Student Seminar
Wednesday, September 17, 2008 - 13:30
1.5 hours (actually 80 minutes)
ISyE Executive Classroom
A successful approach to solving linear programming problems exactly has been to solve the problems with increasing levels of fixed precision, checking the final basis in exact arithmetic and then doing additional simplex pivots if necessary. This work is a computational study comparing different techniques for the core element of our exact computation: solving sparse rational systems of linear equations exactly.