Course Objectives:
Course Outcomes (COs):
Learning outcomes (at course level) |
Learning and teaching strategies |
Assessment Strategies |
|
CO 120: Develop linear programming (LP) models for shortest path, maximum flow, minimal spanning tree, critical path, minimum cost flow, and transshipment problems. CO 121: Use CPM and PERT techniques, to plan, schedule, and control project activities. CO 122: Propose the best strategy using decision making methods under uncertainty and game theory. CO 123: Determine the best choice using decision tree. CO 124: Select the best strategy on the basis of decision criteria under the uncertainty. |
Approach in teaching: Interactive Hours, Discussion, Tutorials, Reading assignments, Demonstration
Learning activities for the students: Self learning assignments, Effective questions, Seminar presentation, Group tasks
|
Class test, Semester end examinations, Quiz, Assignments, Presentation, Individual and group projects |
Operations Research: An Introduction, Characteristics, Nature, Scope and Role of Operations Research and Quantitative Techniques, Scientific approach in decision-making, Techniques of OR, Limitations of these Techniques.
Linear Programming: Formulation of L.P. Problems, Graphical Solution and Simplex Method, Big-M method and Two-phase method; Duality
Elementary Transportation: Formulation of Transport Problem, Solution by N.W. Corner Rule, Least Cost method, Vogel’s Approximation Method (VAM), Modified Distribution Method. (Special cases: Multiple Solutions, Maximization case, Unbalanced case, prohibited routes)
Elementary Assignment: Hungarian Method, (Special cases: Multiple Solutions, Maximization case, Unbalanced case, Restrictions on assignment.)
Network Analysis: Construction of the Network diagram, Critical Path- float and slack analysis (Total float, free float, independent float), PERT, Project Time, Crashing
Decision Theory: Pay off Table, Opportunity Loss Table, Expected Monetary Value, Expected opportunity Loss, Expected Value of Perfect Information and Expected profit for Perfect Information, Decision Tree
Introduction to Game Theory: Pay off Matrix- Two person Zero-Sum game, Pure strategy, Saddle point; Dominance Rule, Mixed strategy, Reduction of m x n game and solution of 2x2, 2 x s, and r x 2 cases by Graphical and Algebraic methods
1. Mathur, Khandelwal, Gupta, Gupta, Operational Research, Ajmera Book Company, Jaipur
2. Agarwal, N.P., and Agarwal, Sonia, Quantitative Techniques For Management, Ramesh Book Depot, Jaipur
3. Agarwal, N.P.,Operation Research, Ramesh Book Depot, Jaipur
4. Vohra, N. D., Quantitative Techniques In Management, Tata McGraw Hill, New Delhi
5. Taha, Hamady A ,Operational Research An Introduction, Prentice Hall of India, New Delhi
6. Kapoor, V. K., Operational Research, Sultan Chand & Sons, New Delhi
7. Nag, N. K., Quantitative Methods, Kalyani Publishers, Jaipur
8. Srivastava, U. K., Shenoy, G.R., and Sharma, S. C., Quantitatives techniques for Managerial Decisions, New Age International