Syllabus (STATISTICS)

Course Type: SEC-1

Semester: 1

Course Code: BSTASEC01T

Course Title: Operations Research & Statistical Inference

(L-P-Tu): 2-0-1

Credit: 3

Practical/Theory: Theory

Course Objective:

Learning Outcome: Basic ideas on Statistics

Unit 1

Introduction to Operations Research, phases of O.R., model building, various types of O.R. problems. Linear Programming Problem, Mathematical formulation of the L.P.P, graphical solutions of a L.P.P. Simplex method for solving L.P.P. Charne’s M-technique for solving L.P.P. involving artificial variables. Special cases of L.P.P. Concept of Duality in L.P.P: Dual simplex method.

Unit 2

Transportation Problem: Initial solution by North West corner rule, Least cost method and Vogel’s approximation method (VAM), MODI’s method to find the optimal solution, special cases of transportation problem. Assignment problem: Hungarian method to find optimal assignment, special cases of assignment problem.

Unit 3

Game theory: Rectangular game, minimax-maximin principle, solution to rectangular game using graphical method, dominance and modified dominance property to reduce the game matrix and solution to rectangular game with mixed strategy.

Unit 4

Inventory Management: ABC inventory system, characteristics of inventory system. EOQ Model and its variations, with and without shortages, Quantity Discount Model with price breaks.

Reading References:

1. Taha, H. A. (2007): Operations Research: An Introduction, 8 Hall of India.
2. Kanti Swarup, Gupta, P.K. and Manmohan (2007): Operations Research, 13th Edition, Sultan Chand and Sons.
3. Hadley, G: (2002): Linear Programming, Narosa Publications
4. Hillier, F.A and Lieberman, G.J. (2010): Introduction to Operations Research- Concepts and cases, 9th Edition, Tata McGraw Hill