Course contents: 
1. Linear Programming (LP): Terminology and formulations.
2. Graphical and Algebraic solutions to LP (Simplex Algorithm):Duality: Writing the dual of an LP, Primal-Dual relationships.
3. Transportation Problem and Assignment Problem.
4. Solving LPs using Solver.
5. Decision theory: making decisions when the risk is unknown.
6. Game theory: Two person gamers.
7. Pure and Mixed Strategies.
8. Queueing and Waiting-time Problems.
9. Dynamic programming, Travelling salesman problem, Knapsack problem and other operations research problems and models.