MATH 8430 LINEAR PROGRAMMING (3 credits)
This course includes a complete development of theoretical and computational aspects of linear programming. Basic theoretical foundations covered include polyhedra, convexity, linear inequalities and duality. Advanced topics such as decomposition and column generation are covered. Both simplex methods and interior point methods are included.