IE 411 B - Optimization of Large Systems
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. Course Information: 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: IE 310 and MATH 415.
Option 1Number of Required Visit(s): 0
Course Level: Graduate