Algorithms for linear, nonlinear, and convex optimization. Emphasis is on methodology and the underlying mathematical structures. Topics include simplex method, network flow methods, optimality conditions, duality, Newton’s method and interior point methods. EE, ME, MIS and MATH majors only. Pre: MATH 311 or consent. (Alt. years)