IE 202 Operations Research I

Credit Information: 
(3+2+0) 4
Description: 
Modelling concepts; linear programming models; simplex and dual simplex methods; duality and sensitivity analysis; transportation, transshipment and assignment problems; integer programming; branch and bound techniques; cutting plane algorithm; basic problems in network theory: minimum spanning tree, shortest path, maximum flow
Prerequisite: 
Math 201.