Math 353 Linear Optimization

Course Description

Course Description (3-0) 3 credits. Prerequisites: MATH 321 or MATH 315 or permission of instructor. Convex sets and functions, linear inequalities and combinatorial problems; topics in linear programming from fundamental theorems of simplex method through sensitivity analysis, duality, transportation, and assignment problems.

Couse Learning Outcomes

A student who successfully completes this course should be able to:

  1. interpret the basic characteristics of the Simplex Method
  2. apply solution techniques in a variety of applications, such as, scheduling problems, mixture problems, and assignment problems
  3. apply and interpret results from sensitivity analysis
  4. formulate and communicate the appropriate mathematical notation that is used with linear models
  5. implement the use of some type of software to solve linear programming problems