Math 210 -- Linear Optimization and Game Theory 

The object of Math 210 is the understanding of the mathematics of optimization problems with a finite number of variables subject to constraints. Although the course relates to many practical applications, the focus will be on the structure of optimal solutions, algorithms to find them, and the underlying theory that explains both. This course is not a requirement for the math major or minor, but it can be counted as a 200-level elective toward either the major or the minor or the concentrations in mathematical economics. Math 210 is typically offered in alternate years.

Prerequisites: Math 121 and consent of the instructor, or Math 215

Who should take this course?
Math majors or minors
Concentrators in mathematical economics
Students in the social sciences interested in optimization techniques


Topics covered:
Linear programming
The simplex algorithm
Matrix games
Network flow problems: shortest path, assignment, transportation
Nonlinear programming


---

For detailed information about Math 210 this year, please consult the list of Fall Courses and Spring Courses linked to the Mathematics and Statistics Home Page.