IE 411
Fall 2023 All Classes
All Classes
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 257 or MATH 415.
Section Status updates every 10 minutes.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
62888
|
Lecture-Discussion
|
A
|
2:00PM
-3:20PM
|
TR
|
101 Transportation Building
|
Hanasusanto, G
Sharmili, N |
|
|
|
62889
|
Lecture-Discussion
|
B
|
2:00PM
-3:20PM
|
TR
|
101 Transportation Building
|
Hanasusanto, G
Sharmili, N |
|