MATH5711
MATH 5711 - Linear Programming and Combinatorial Optimization (4 Cr.)
School of Mathematics (11133)
TIOT - College of Science and Engineering
MATH 5711 - Linear Programming and Combinatorial Optimization (4 Cr.)
Course description
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]
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]
Minimum credits
4
Maximum credits
4
Is this course repeatable?
No
Grading basis
OPT - Student Option
Lecture
Requirements
001186
Fulfills the writing intensive requirement?
No
Typically offered term(s)
Every Fall & Spring