Skip to content

Part 3 · Course

MA381 OPTIMIZATION I

Mathematical Sciences · 4 versions

Offerings are listed from 2027-1 Fall through 2031-1 Fall.

MA381 NONLINEAR OPTIMIZATION

  • 3.0 credit hours
  • (BS=0.0, ET=0.0, MA=0.0)
  • Version 1993-1
  • Archived
Scope
This course provides an undergraduate presentation of nonlinear topics in mathematical programming that builds on multivariable Calculus II. The emphasis of this course is on developing a conceptual understanding of the fundamental topics introduced. These topics include general convexity, convex functions, derivative-based multivariable search techniques, minima and maxima of convex functions, gradients, hessian matrices, Lagrange Multipliers, Fritz-John and Kuhn-Tucker optimality conditions, and constrained and unconstrained optimization. Computer software is used to explore and expose various key ideas throughout the course.
Lessons
40 @ 55 min (2.500 Att/wk)
Labs
0 @ 0 min
Special requirements
One special problem in optimization.
Prerequisites
one of