Catalog Description: Linear programming with a view toward its uses in economics and systems analysis. Linear algebra and geometric foundations of linear programming; simplex method and its variations; primal dual programs; formulation and interpretation of linear programming models, including practical problems in transportation and production control. Optional computer projects. AMS 341 and AMS 342 may be taken in either order, though it is recommended that AMS 341 be taken first.
Prerequisite: AMS 210 or MAT 211
3 credits
Textbooks: Introduction to Mathematical Programming, Fifth Edition, by Wiston and Venkataramanan, John Wiley and Sons
THIS COURSE IS OFFERED IN THE SPRING SEMESTER ONLY
Spring 2010 Section
52498 LEC 01 TUTH 12:50-02:10PM Loc: Javits 111 Inst: Estie Arkin AMS 341 Webpage
1. Sample linear programming problems with geometric solution. (Chap. 1) – 3 class hours
2. Simplex Method and variations (Chap. 2) – 9 class hours
3. Sensitivity Analysis and Economic Applications (Chap. 3) – 6 class hours
4. Linear Algebra and the Revised Simplex Method (Appendices) – 4 class hours
5. Duality Theory and Its Applications (Chap 4) – 5 class hours
6. Transportation and Transshipment Problems (Chap 8) – 5 class hours
7. Integer Programming (Chap.9) – 2 class hours
8. Dynamic Programming (Chapter 11) - 3 class hours
9. Examinations and Review – 5 class hours