MATH 681 - Topics in Optimization

Units: 4
Topics in optimization such as integer programming, network algorithms, dynamic programming, game theory, graph theory, quasi-Newton methods for multi-variable unconstrained optimization, constrained optimization with nonlinear constraints, convex optimization, quadratic programming, nonlinear least squares.

Prerequisites: MATH 680.
Repeatability: May be repeated for credit for a maximum of 12 units.
Possible Instructional Methods: Entirely On-ground.
Grading: A-F grading only.
Student Learning Outcomes - Upon successful completion of this course students will be able to:

Apply definitions and theorems of optimization.
Apply the techniques of optimization to solve problems.