Operations Research.1. Unit-1
2. Unit-2
3. Unit-3
4. Unit-4
5. Unit-5
|
Operations Research. SyllabusUNIT –1 LINEAR PROGRAMMING LP formulations, Graphical method for solving LP with 2 variables, Simplex method, Application of simplex method for maximization and minimization of LP problems, Artificial variable technique for finding the initial basic feasible solution, The Big-M method, Degeneracy in simplex method, Duality theory in LP, Dual simplex method. UNIT-2 TRANSPORTATION MODEL North – West comer rule, Least cost method, Vogel's Approximation method, Modi Method, Assignment problem, Dynamic Programming: Basic concepts, Bellman's optimality principle, Dynamic programming approach in decision making, Optimal subdivision problem. UNIT- 3 INVENTORY MODELS Introduction to the inventory problem, Deterministic models, The classical EOQ (Economic order quantity) model, Purchasing model with no shortage, Manufacturing model with no shortage, purchasing model with shortage, Manufacturing model with shortage, Inventory models with probabilistic demand. UNIT –4 SEQUENCING AND QUEUING THEORY Sequencing problem, Johnson's algorithm for processing N-jobs through 2 machine problem, N-jobs through 3 machine problem, 2- job through N machine by graphical method, Characteristics of queuing system- steady state M/M/1, M/M/1K and M/M/C queuing models. UNIT- 5 CPM and PERT Arrow network, Time estimates – Earliest expected time, Latest allowable occurrence time and slack, Critical path, Probability of meeting scheduled date of completion of project, Calculation on CPM network, Various floats for activities, Critical Path, Updating project, Operation time cost trade off curve & project time cost trade off curve, selection of schedule based on cost analysis. |