Operations Research (Theory)

Paper Code: 
24CBDA511
Credits: 
03
Periods/week: 
03
Max. Marks: 
100.00
Objective: 

The course will enable the students to solve linear programming models, simple queuing model, and two-person zero sum games and Network models.

Course Outcomes: 

Course

Learning outcome

(at course level)

Learning and teaching strategies

Assessment Strategies

Course Code

Course

Title

24CBDA 511

Operations Research

(Theory)

 

CO271.  Discuss a deep understanding of the Operations Research and its applications.

CO272. Analyse, solve, and optimize transportation problems.

CO273. Formulate and solve assignment problems.

CO274. Apply PERT-CPM methods, analyse critical paths, and solve sequencing problems in complex network scheduling scenarios.

CO275. Solve the real-world problems of game theory.

CO276.Contribute effectively in course-specific interaction

Approach in teaching: Interactive Lectures, Discussion, Power Point Presentations, Informative videos, Group Discussions. Learning activities for the students: Self learning assignments, Presentations.

Quiz, case study. Power point presentations, activities.

-Personal Branding-Blog Post/Article writing

 

9.00
Unit I: 
Introduction to Operations Research :

Basics definition, scope, objectives, phases, models and limitations of Operations Research. Linear Programming Problem – Formulation of LPP, Graphical solution of LPP. Simplex Method, Artificial variables, big-M method, two-phase method, degeneracy and unbound solutions.

 

9.00
Unit II: 
Transportation Problem:

Formulation, solution, unbalanced Transportation problem. Finding basic feasible solutions – Northwest corner rule, least cost method and Vogel’s approximation method. Optimality test by MODI method. 

9.00
Unit III: 
Assignment problem and optimal solutions:

Assignment model. Formulation. Hungarian method for optimal solution. Solving unbalanced problem. Traveling salesman problem and assignment problem. 

 

9.00
Unit IV: 
Network Scheduling:

Network Scheduling by PERT-CPM, Network logical sequencing, Concurrent activities, Critical path analysis, Probability consideration in PERT, Distinction between PERT and CPM. Sequencing models. Solution of Sequencing Problem – Processing n Jobs through 2 Machines, Processing 2 Jobs through m machines, Processing n Jobs through m Machines.

 

9.00
Unit V: 
Games Theory:

Competitive games, rectangular game, saddle point, minimax (maximin) method of optimal strategies, value of the game. Solution of games with saddle points, dominance principle. Rectangular games without saddle point – mixed strategy for 2 X 2 games.

 

ESSENTIAL READINGS: 

Suggested Text Books

  1. Prem Kumar Gupta & D.S. Hira. Operations Research 7th edition - S.Chand & Company Pvt. Ltd, 2014.
  2. Kanti Swarup, P.K. Gupta and Man Mohan- Operations Research- Sultan Chand and Sons, 2014.
  3. Sharma, S.D. (1997). Operation Research, Kedar nath Ramnath and Co. (Publishers)

 

REFERENCES: 

SUGGESTED REFERENCE BOOKS

  1. H.A Taha- Operations Research. An introduction 10th edition Pearson Prentice Hall, 2020.
  2. Wayne L. Winston-Operations Research 4th edition, Thomson Learning-2004.
  3. R. Panneer Seevam- Operations Research 2nd edition PHI Learning- 2009.

 

e RESOURCES

  1. https.//onlinecourses.swayam2.ac.in/cec20_ma10/preview
  2. https.//onlinecourses.nptel.ac.in/noc20_ma23/preview
  1. http.//ecoursesonline.iasri.res.in/course/view.php?id=104
  2. https.//www.engineeringenotes.com/project-management-2/operations-research/assignment-problem-meaning-methods-and-variations-operations-research/15652
  3. https.//www.geeksforgeeks.org/transportation-problem-set-6-modi-method-uv-method/
  4. https.//www.geeksforgeeks.org/hungarian-algorithm-assignment-problem-set-1-introduction/
  5. http.//www.universalteacherpublications.com/univ/ebooks/or/Ch6/hungar.htm

 

 JOURNALS

  1. Journal of the Brazilian Computer Society, SpringerOpen, https://journal-bcs.springeropen.com/
  2. Journal of Internet Services and Applications, SpringerOpen: https://jisajournal.springeropen.com/

 

Academic Year: 
2024-25
  • Printer-friendly version