MATH 680 - Optimization

Units: 4
Introduction to Linear Programming, including the Simplex method, duality theory, sensitivity analysis, and special applications. Topics such as integer programming, game theory, graph theory, and dynamic programming may also be covered.

Prerequisites: MATH 310.
Possible Instructional Methods: 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.