Prereq.:IE 3520 or equivalent. Optimization of linear objective functions subject to linear constraints; vector spaces, convex analysis, polyhedral sets; matrix versions of simplex, revised simplex, bounded variables; duality theory and primal-dual simplex algorithms; postoptimal and parametric analysis; decomposition and cutting plane algorithms.
Add to Portfolio (opens a new window)