Mathematical Programming I

4.0 credits · Graduate

Rigorous treatment of the theory and computational techniques of linear programming and its extensions, including formulation, duality theory, algorithms; sensitivity analysis; network flow problems and algorithms; theory of polyhedral convex sets, systems of linear equations and inequalities, Farkas' Lemma; and exploiting special structure in the simplex method and computational implementation.