MATH5711: Linear Programming and Combinatorial Optimization
4 Credits
Simplex method, connections to geometry, duality theory,
sensitivity analysis. Applications to cutting stock, allocation of resources, scheduling problems. Flows, matching/transportation
problems, spanning trees, distance in graphs, integer programs, branch/bound, cutting planes, heuristics. Applications to traveling salesman, knapsack problems.
prereq: 2 sems soph math [including 2243 or 2373 or 2573]
View on University Catalog
All Instructors
B+ Average (3.358)Most Common: A (29%)
This total also includes data from semesters with unknown instructors.