MATP 6640 - Linear Programming

A unified development of linear systems and linear programming, polyhedral theory, the simplex method, interior point methods, decomposition methods for large-scale linear programming problems, the ellipsoid method, column generation algorithms for stochastic programming, and other problems.

Prerequisites/Corequisites: Prerequisite: MATP 4700 or DSES 4770.

When Offered: Spring term even-numbered years.

Cross Listed: (Cross listed as DSES 6770. Students cannot obtain credit for both this course and DSES 6770.)

Credit Hours: 4

Close Window