Convex geometry, the simplex method and duality, pivot rules, degeneracy, decomposition and column generation methods, the complexity of linear programming and the ellipsoid algorithm, interior point methods for linear programming.
Convex geometry, the simplex method and duality, pivot rules, degeneracy, decomposition and column generation methods, the complexity of linear programming and the ellipsoid algorithm, interior point methods for linear programming.
