Linear Programming and Network Flows

3 credits · Undergraduate

This course addresses modeling and algorithms for optimization of linear constrained optimization problems. The simplex method; theorems of duality; complementary slackness. Applications in production planning and resource allocation. Graph and network problems as linear programs with integer solutions. Algorithms for selected network flow problems. Transportation and logistics problems. Dynamic programming and its role in applications to shortest paths, project management and equipment replacement.