Title: Algorithms and conjectures for Linear Optimization

In this talk, 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.  While discussing open problems and conjectures related to both pivot algorithms and interior point methods, the audience is encouraged to consider how algorithms could utilize the readily available multi-core architectures.