|
Sep 04, 2024
|
|
|
|
MATH 380 - Linear Programming Units: 3 Problems of maximizing or minimizing a linear function subject to linear constraints. Topics include problem formulation, solution procedures, duality theory, sensitivity analysis, transportation and assignment problems.
Prerequisites: MATH 210 or MATH 215 with a grade of C- or better. Possible Instructional Methods: On-ground. Grading: A-F or CR/NC (student choice). Course Typically Offered: Variable Intermittently
Student Learning Outcomes - Upon successful completion of this course students will be able to:
- Apply the definitions, techniques and theorems of linear programming.
- Effectively solve real-world problems using linear programming.
- Communicate linear programming based solutions to real-world problems effectively.
Add to Folder (opens a new window)
|
|