MAT 366 - Deterministic Models in Operations Research

Formulation and analysis of mathematical models for the optimal solution of decision-making problems under certainty. Linear programming; the simplex method, duality and sensitivity analysis. Network analysis: shortest paths, minimal spanning tree, network flows. Introduction to nonlinear optimization: convex programming, Kuhn-Tucker conditions. Applications to pricing, allocation, production planning, transportation, and scheduling problems.

Prerequisite(s): MAT 153 and MAT 295.
Co-requisite(s):
Credits: 3

Meets the Following Core Requirement: Capstone
Course Typically Offered:
Course Type: Mathematics