The objective of this course is to acquaint the students with the use of operational research techniques in decision-making
Basic Concepts and Definitions
Linear Programming: Mathematical formulation of Linear Programming problems and their solution using Graphic approach and Simplex method, Duality Sensitivity analysis
: Solving the problem. Testing the optimality MODI method. Cases of unbalanced problems, Degeneracy, Maximization objective, Multiple solutions and Prohibited Routes
Assignment: Solving the problem. Cases of unbalanced problems, multiple optimum solutions, maximization objective and unacceptable assignments
Network with one estimate of time. Networks with three estimates of time. Time-cost trade-off. Probability consideration under Pert
Games of Pure strategy, Games of Mixed strategy, Law of Dominance, Sub Game
Queuing Theory: Elements of Queuing theory, Single Channel Queuing Problem.
Maximin, Minimax, and Maximax expected pay off and regret, Expected value of Perfect Information, Decision Tree Analysis, Theory
Monte Karlo Simulation Model