Prerequisites: MATH 010A; MATH 113 or MATH 131 (may be taken concurrently)
Description: Introduction to classical optimization, including unconstrained and constrained problems in several variables, Jacobian and Lagrangian methods, and the Kuhn-Tucker conditions. Covers the basic concepts of linear programming, including the simplex method and duality, with applications to other subjects.