1. Linear programming and simplex method.
2. Revised simplex method.
3. Duality of linear programming.
4. Sensitivity analysis.
5. Transportation and assignment problems.
6. Network flow problems.
7. Game theory.
Intended Learning Outcomes
CILO-1: Explain and use simplex method to solve linear programming problems.
CILO-2: Explain and use revised simplex method to solve linear programming problems.
CILO-3: Interpret the theory of simplex method and apply to the transportation algorithm.
CILO-4: Explain and solve matrix games.