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 OPTIMIZATION I

  • 3.0 credit hours
  • (BS=0.0, ET=0.0, MA=3.0)
  • Version 2027-1
  • In effect
Scope
This course introduces the fundamental principles and methods of optimization, focusing on both linear and nonlinear models. Students learn to formulate and analyze optimization problems, explore core algorithms, and interpret solutions in practical contexts. Topics may include foundational modeling techniques, linear and integer programming, duality concepts, and an introduction to nonlinear and discrete optimization. Emphasis is placed on conceptual understanding, problem-solving, and the use of computational tools to implement and explore optimization models. Applications to real-world systems and the use of advanced optimization software are emphasized throughout.
Lessons
40 @ 55 min (2.500 Att/wk)
Labs
0 @ 0 min
Special requirements
One (or more) special problem(s).
Prerequisites
MA371
MA381 version 2027-1 offerings
Term Sections Section size Capacity Enrolled Wait list Seats Closed Details
2027-2 Spring 2 18 36 30 0 6 No Hours for 2027-2 Spring
2028-2 Spring 3 18 54 34 0 20 No Hours for 2028-2 Spring
2029-2 Spring 2 18 36 0 0 36 No Hours for 2029-2 Spring
2030-2 Spring 3 18 54 0 0 54 No Hours for 2030-2 Spring

MA381 NONLINEAR OPTIMIZATION

  • 3.0 credit hours
  • (BS=0.0, ET=0.0, MA=3.0)
  • Version 2013-1
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 (or more) special problem(s).
Prerequisites
one of
MA381 version 2013-1 offerings
Term Sections Section size Capacity Enrolled Wait list Seats Closed Details
2027-8 Fall Exch 1 18 18 2 0 16 No Hours for 2027-8 Fall Exch

MA381 NONLINEAR OPTIMIZATION

  • 3.0 credit hours
  • (BS=0.0, ET=0.0, MA=0.0)
  • Version 2003-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 (or more) special problem(s).
Prerequisites
one of

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