Algorithms and Conjectures for Linear Optimization

Tamás Terlaky
Lehigh University

In this talks we briefly review some fundamental algorithmic concepts for Linear optimization.
The algorithms include elimination and pivot algorithms, interior point methods and the perceptron algorithm. Complexity and convergence of the algorithms will be discussed .
Open problems and conjectures related to both pivot algorithms and interior point methods will
be discussed. Finally, we consider how the algorithms could utilize the readily available
multi-core architectures.

Presentation (PDF File)

Back to Efficiency of the Simplex Method: Quo vadis Hirsch conjecture?