Operational Research: Basic Concepts and Definitions Linear Programming: Mathematical formulation of Linear Programming problems and their solution using Graphic approach and Simplex method, Duality Sensitivity analysis.

Transportation: 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

PERT/CPM: Network with one estimate of time. Networks with three estimates of time. Time-cost trade-off. Probability consideration under Pert

Game Theory: Games of Pure strategy, Games of Mixed strategy, Law of Dominance, Sub Game Queuing Theory: Elements of Queuing theory, Single Channel Queuing Problem.

Decision Theory: Maximin, Minimax, and Maximax expected pay off and regret, Expected value of Perfect Information, Decision Tree Analysis, Theory Simulation- Methodology and Application of Simulation technique. Solution of elementary inventory and queuing problems by using Monte Karlo Simulation Model Note- The candidate shall be permitted to use battery operated pocket calculator that should not have more than 12 digits, 6 functions and 2 memories and should be noiseless and cordless