Advanced Operations Research I

Graduate

Theory and computational techniques for solving linear and integer programming problems. Theoretical foundations of the simplex algorithm. Duality and sensitivity analysis. Network flow methods. Integer programming problems. Branch and bound methods, implicit enumeration methods, cutting plane methods. Interior point methods and other recent developments. (Prerequisite: INDE-3120 or equivalent.) (3 lecture hours a week.)