MA 421 Math Optimization, Applications & Analysis
This course is a project-based exploration of topics in optimization and simulation. Topics vary by instructor but typically include linear, integer, binary, and nonlinear programming, stochastic processes, some network optimization, and the Analytic Hierarchy Process. We explore the modeling, algorithmic and heuristic solution approaches to, and sensitivity analysis of problems such as the simplex method, scheduling problems, resource allocation problems, the Knapsack problem, Traveling Salesman problem, and ranking problems. Computers and technology will again play an important role as we investigate both the implementation and the theoretical basis of solution techniques. This course will bring together topics from single and multivariable calculus, linear algebra, and probability.
Prerequisite
Grade of "C " or better in
MA 334.
Corequisite
Recommended prerequisite or concurrent enrollment in
MA 315.
Faculty
Sullivan, Eric | Wendt, Theodore |
Offered
Annual Fall Semester