Theory of Optimization

Undergraduate

Linear and convex programming, convex functions and duality; Lagrange multipliers; Kuhn-Tucker methods. Topics may include: genetic algorithms, simulated annealing. Prerequisite(s): MATH 3533 and MATH 3603, with minimum grades of C-.