8th Semester
5 PapersB.Sc. Statistics
Select Paper / CourseMJC-16
MJC-163 CreditsMajor (MJC)
Operations Research
Single-tap topic to complete/uncomplete • Hold (long-press) for Ask AI
1
Unit 1: UNIT I
Convex sets and their properties
Introduction to linear programming problem
Solution by graphical method
Simplex method
Optimality and unboundedness
Artificial variables
Two-phase method
Big-M method
Duality
Formulation of the dual problem
Primal-dual relationships
Economic interpretation of the dual
2
Unit 2: UNIT II
Transportation problem and its mathematical formulation
North-west-corner method
Least cost method and Vogel approximation method for determination of initial basic solution
Algorithm for solving transportation problem
Transportation problem as a linear programming problem
3
Unit 3: UNIT III
Assignment problem and its mathematical formulation
Hungarian method for solving assignment problem
Assignment problem as a linear programming problem
4
Unit 4: UNIT IV
Game theory: Rectangular game
Pure and mixed strategies
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
Recommended Textbooks:
Hadley, G.,(2002): Linear Programming, Narosa Publishing House, New Delhi.
Buy on AmazonTalia, H.A., (2006). Operations Research, An Introduction, Prentice-Hall India.
Buy on AmazonSharma, S.D., (2014): Operations Research, Theory and Application.
Buy on AmazonSwarup, K., Gupta, P.K. and Mohan, M.(2019): Operations Research, Sultan Chund und Sun.
Buy on Amazon