I is discussed. Recent developments in linear programming. The course highlights advances in interior point methods and also addresses developments in the simplex method. The relationships between these methods are discussed, as well as their relationships to methods in nonlinear programming. Also discussed are advances in data structures and other implementation issues.
Students have the opportunity to test software and solve large-scale linear programs.
Contents vary and may include topics in optimization, stochastic methods, or decision support that are not covered in the standard OR curriculum. May be repeated for credit when topics are distinctly different.