IE 3051 - COMPUTATIONAL OPTIMIZATION

Minimum Credits: 3
Maximum Credits: 3
This course addresses issues arising in the implementation of optimization algorithms. Computational strategies and techniques will be explored. A major emphasis will be placed on implementing various algorithms for large- scale linear, nonlinear, and integer programs. Such algorithms include benders' decomposition, Dantzig-Wolfe decomposition, Lagrangian relaxation and algorithms for specially-structured problems.
Academic Career: Graduate
Course Component: Lecture
Grade Component: Grad Letter Grade
Course Requirements: PROG: Swanson School of Engineering

Click here for class schedule information.

Add to Portfolio.

Close Window