MATH 5050 - Linear Programming

3 hours

Convex polyhedra, simplex method, duality theory, network flows, integer programming, ellipsoidal method, applications to modeling and game theory.

Prerequisite(s): Consent of department.