MATH 6881. Linear Programming
| Course Code | MATE 6881 |
|---|---|
| Course Title | Linear Programming |
| Credits | 3 |
| Hours | 3 per week |
| Prerequisites | MATH 4031, MATH 4100 |
| Description | Theory and algorithms for finite dimensional linear optimization. The Simplex method and its variants. Duality complementary slackness condition. Sensitivity. Decomposition. Dual and primal-dual methods. Optimization in graphs and networks. Combinatorial applications. Algorithmic complexity. Khachian’s algorithm. Karmarkar’s algorithm. |
| Additional Information |