IE 411

fall 2016
 
All Classes
Optimization of Large Systems
Show Final Exam Schedule

Credit: 3 OR 4 hours.

Practical methods of optimization of large-scale linear systems including extreme point algorithms, duality theory, parametric linear programming, generalized upper bounding technique, price-directive and resource-directive decomposition techniques, Lagrangian duality, Karmarkar's algorithm, applications in engineering systems, and use of state-of-the-art computer codes.

3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: IE 310 and MATH 415.

Closed
Section Status Closed
Open
Section Status Open
Pending
Section Status Pending
Open (Restricted)
Section Status Open (Restricted)
Unknown
Section Status Unknown
Section Status updates every 10 minutes.
Detail Status CRN Type Section Time Day Location Instructor