Prerequisites: MATH 010A with a grade of "C-" or better; MATH 113 or MATH 131 with a grade of "C-" or better (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.
Referenced in
- Biological Sciences — Major Requirements
- Computer Science and Engineering — Major Requirements
- Environmental Sciences — Major Requirements
- Mathematics — Major Requirements for the Bachelor of Arts and Bachelor of Science in Mathematics
- Statistics — Major Requirements
- Graduate Programs — Master’s Program