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.

100 students
SWFDCBA

  • 4.77

    /6

    Recommend

  • 5.10

    /6

    Effort

  • 5.42

    /6

    Understanding

  • 4.97

    /6

    Interesting

  • 5.12

    /6

    Activities
      Contribute on our Github

      Gopher Grades is maintained by Social Coding with data from Summer 2017 to Summer 2025 provided by the University in response to a public records request

      Not affiliated with the University of Minnesota

      Privacy Policy