everything.study
EECS 261A

Linear Optimization Methods

4 Units.

Formulation, solution, and analysis of linear programming and linear network flow problems. Simplex methods, dual ascent methods, interior point algorithms, and auction algorithms. Duality theory and sensitivity analysis. Shortest path, max-flow, assignment, and minimum cost flow problems.

Prerequisites & course information

Formulation, solution, and analysis of linear programming and linear network flow problems. Simplex methods, dual ascent methods, interior point algorithms, and auction algorithms. Duality theory and sensitivity analysis. Shortest path, max-flow, assignment, and minimum cost flow problems.

Sources