Quick Course Search

MATH373 - Mathematical Programming and Optimization I

Introduction to optimization. Problem formulation. Linear programming. The simplex method and its variants (revised Simplex method, dual simplex method). Extreme points of polyhedral sets. Theory of linear inequalities (Farkas Lemma). Complementary slackness and duality. Post-optimality analysis. Interior point methods. Applications (elementary games, transportation problems, networks, etc.). Prerequisites: One of MATH 102, 125 or 127, and one of MATH 209, 214 or 217.

Fall Term 2020

Lecture Sections

Fall Term 2020 - LEC A1 (75164)

TR 12:30:00 - 13:50:00 (CAB 243)

View Previous Terms