Advanced Optimization

Catalog description

Prerequisites: SCMA 6350 and admittance into the Business Administration PhD Program, or consent of instructor. This doctoral seminar focuses on the theories and methodologies in deterministic optimization. It covers topics including the simplex method and duality theory in linear programming, network optimization, branch-and-bound, branch-and-cut, decomposition methods in integer linear programming, and various heuristics and metaheuristics for solving NP-hard combinatorial optimization problems.