The Department of Combinatorics & Optimization Tutte colloquium presents:
Professor Robert E. Bixby - Rice University and Gurobi Optimization
"The simplex algorithm is alive and well"
Abstract
The venerable simplex algorithm, introduced by George Dantzig in 1947, has survived the interior-point onslaught that began in 1984. It remains today the most used method for solving real-world linear programming problems. However, the version of the simplex algorithm that dominates in practice is no longer the primal algorithm that was proposed by Dantzig, but a dual variant introduced by Lemke in 1954. In this talk, we will describe the key ingredients in a modern dual-simplex implementation and give some reasons why this algorithm is so much more effective than its primal variant.
Speaker
Dr. Bixby is a world leader in optimization and software design for solving optimization problems. He will be receiving an honorary DMath degree from the University of Waterloo at convocation on June 14.
Everyone is welcome. Refreshments will be available before the talk at 3 p.m. in William G. Davis Computer Research Centre (DC) 1301.