The course covers advanced topics in linear programming includes: vector analysis, simplex methods,
duality and sensitivity analysis, special simplex forms, transportation and assignment problems,
game theory, revised simplex methods, parametric linear programming, and networks.
Advanced Linear Programming 429525
Chapter1 Introduction: Vectors and Matrices.
Chapter2 Duality
2.1 Matrix Definition of the Dual Problem
2.2 Optimal Dual Solution
Chapter3 Sensitivity Analysis
3.1 Changes in c's, b's.
3.2 Adding or Deleting Constraint
3.3 Changes in aij's.
Chapter4 Efficient Computational Algorithms
4.1 Product Form of Matrices
4.2 Revised Simplex Method
Chapter5 Parametric Linear Programming
Activity | Percent (%) |
---|---|
1sr exam | 15% |
2nd exam | 15% |
activities | 20% |
Final | 50% |