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: MATH 102, 120, 125, or 127; MATH 209, 214, or 217.

Fall Term 2018

Lecture Sections

Fall Term 2018 - LEC A1 (62940)

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

View Previous Terms