OIDD 9130
Advanced Linear Programming
In-depth study of the theory and algorithms related to the solution of linear programming problems. Optimality conditions, duality and sensitivity analysis. Primal and dual simplex methods. Interior point methods. Large-scale optimization. Dantzig-Wolfe decomposition. Not Offered Every Year Prerequisite: OIDD 9100 OR ESE 5040 1 Course Unit
Sources
- Course catalogue โ2026โ2027