Linear programming problem(LPP):
introduction, structure of linear programming model, advantages, general model of Linear programming problem(LPP), examples of LP formulation, graphical solutions of LP problem and Solution of LPP by simplex method:
Linear programming problem(LPP):Artificial variables-
two-phase method, Big M method. Duality in linear programming, formulation of dual linear programming and examples.
Transportation and Assignment Problems:
Mathematical model of transportation problem, methods of finding initial solution (Northwest corner rule, Least cost method, Vogel’s approximation method), test for optimality in TP using MODI Method. Mathematical model of assignment problem, Hungarian method for solving assignment problem.
Theory of games:
introduction, two-person zero sum games, pure strategies (MinMax and MaxMin principles), mixed strategies. The rules of principles of dominance, algebraic method to solve games without saddle point, graphical methods to solve games.
Network Analysis:
PERT and CPM, Network construction and determination of critical path, Calculation of ES, EF, LS, LF, TF, FF and IF, Crashing of a project, Scheduling of a project and resource levelling.
Question Paper Pattern:
• The Question paper will have TEN questions
• Each full question will be for 20 marks
• There will be 02 full questions (with maximum of four sub questions) from each module.
• Each full question will have sub questions covering all the topics under a module.
• The students will have to answer FIVE full questions, selecting one full question from each module.
Text books
1. Operations Theory and Applications, J.K. Sharma, 5th edition, MacMillan publisher India(Chapter 1,2,3,4,5,910,11,12,20).
2. Operations Research S.D Sharma, Kedarnath, Ramnath and Co, 2002.
References
1. Operations Research – An Introduction Taha H A- Low price edition 7th edition,2006.
2. Introduction to operation Research, Hiller and Liberman, Mc GRawHill , 5th edition ,2001.
3. Operation Research, Prem Kumar Gupta, D S Heera, S Chand Pub., New Delhi, 2007.
Course Outcomes:
At the end of the course, students will be able to
CO1: Apply problem solving techniques through OR approaches.
CO2: Formulate the problem using linear programming technique.
CO3: Analyze the optimal solution for the given problem by applying Transportation problems.
CO4: Analyze the strategies with different players through game theory approach.
CO5: Analyze the sequence of jobs to be executed by machines for the given problem.