Courses: Linear Optimization and Game Theory (CMSCH210B01)
Covers in depth the mathematics of optimization problems with a finite number of variables subject to constraints. Applications of linear programming to the theory of matrix games and network flows are covered, as well as an introduction to nonlinear programming and hidden Markov models. Emphasis is on the structure of optimal solutions, algorithms to find them, and the underlying theory that explains both. This course is designed for students interested in computer science, economics, or mathematics.
Syllabus: View course syllabus
Prerequisites: MATH 215 or MATH 115 and concurrent registration in MATH 215.
Fulfills: NA QU IIandQ