Syllabus

Course Code: ST-202    Course Name: Operations Research

MODULE NO / UNIT COURSE SYLLABUS CONTENTS OF MODULE NOTES
1 Convex sets, Linear Programming problems (LPP): Formulation, examples and forms, Hyperplane, Open and Closed half spaces. Feasible, basic feasible and optimal solutions.Solution of LPP by Graphical and Simplex method. Duality in linear programming.
2 Transportation Problems- Initial Basic Feasible Solution by North-West Corner Rule, Row minima method, Column minima method, Lowest Cost Entry Method, Vogel’s Approximation Method, Optimum Solution of Transportation Problems. Assignment problem and its solution. Decision Theory : Algorithm for decision based problems, Types of decision making, Decision making under uncertainty : Criterion of optimism , Criterion of pessimism and Hurwicz criterion . Decision making under risks: EMV and EOL.
3 Game Theory : Terminology , two person zero sum game; game of pure strategy , reducing game by dominance, solution of game of mixed strategy without saddle point using linear programming method. Replacement models: replacement of items whose efficiency deteriorates with time and (i) The value of the money remains same during the period (ii) The value of the money also changes with time. Criterion of present value for comparing replacement alternatives.CPM (Critical path method) to solve the network problems and PERT.
4 Inventory models: Deterministic inventory models ( D.I.M ) without shortages: EOQ model with constant rate of Demand, EOQ model with different rate of Demand, EOQ with finite rate of replenishment. D.I.M. with shortages : E O Q model with constant rate of Demand and scheduling time constant, E O Q model with constant rate of Demand and scheduling time variable. Simple Multi-item deterministic inventory model with constraint: model with limitation on space, model with limitation on investment. Queueing models : Introduction of queueing models, steady state solution of M/M/1 , M/M/1/N , M/M/C and M/M/C/N and their measures of effectiveness.
Copyright © 2020 Kurukshetra University, Kurukshetra. All Rights Reserved.