Syllabus
Unit 1
Evolution of OR – Fundamentals of OR Modelling Approach – Linear Programming –Assumptions – formulation -graphical method -simplex method – dualitytheory- primal-dual relationships -sensitivity analysis Transportation and Assignment Problems – Specific features and methods of transportation problem -Hungarian method for solving assignment problems – travelling salesman problem – Dynamic Programming – Characteristics – optimality principle -deterministic problems.
Unit 2
Network Models- Project Networks- CPM / PERT- Project Scheduling – crashing networks and cost considerations – Resource leveling and smoothing, shortest route problem – minimal spanning tree problem – maximal flow problem Decision Theory – Decision making under uncertainty – decision trees – decision under risk – EMV, EOL, EVPI – Game theory – mixed strategies – dominance property – 2 x n and m x 2 games.
Unit 3
Flow shop scheduling– Johnsons algorithm for n jobs and two machines and n jobs and m machines – Inventory Models – Deterministic manufacturing and purchase models – quantity discounts Queueing models – Poisson arrival and exponential service times – Single server and multi-server modelSimulation –Monte Carlo simulation – simple problems.