InIn4021
|
|
Course DescriptionFormulation and solution of linear programming problems; the simplex method, duality and sensitivity analysis; transportation problems. Shortest route and maximum flow algorithms. Critical path method (CPM) and program evaluation and review technique (PERT); integer programming problems: branch and bound. Introduction to dynamic programming. General Information
Visit the Institute for Operations Research and Management Science (INFORMS) web site.
|
Last modified: December 03, 2000 |