MATH 322 - Optimization

Credits: 3
Theory of, and computer algorithms for, the solution of mathematical programming problems and applications. Topics include the simplex method, cutting planes, branch and bound methods, and numerical methods for unconstrained optimization, game theory, and dynamic programming. Previous computer programming or spreadsheet experience is recommended but not required. Usually offered in the spring semester of even numbered years.

Prerequisite(s): MATH 260 or MATH 264.