OPERATIONS RESEARCH

Paper Code: 
CBDA 511
Credits: 
3
Periods/week: 
3
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 (COs).

Course Outcome (at course level)

 

Learning and teaching strategies

Assessment Strategies

On completion of this course, the students will:

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

CO227. Apply different solving techniques to develop mathematical models for future predictions.

CO228. Design and develop competitive strategies with use of Operations Research.

CO229. Solve the Industrial and real-world problems of transportation.

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

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 model. Formulation. Hungarian method for optimal solution. Solving unbalanced problem. Traveling salesman problem and assignment problem. 

 

9.00
Unit IV: 

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: 
  • Prem Kumar Gupta & D.S. Hira. Operations Research 7th edition - S.Chand & Company Pvt. Ltd, 2014.
  • Kanti Swarup, P.K. Gupta and Man Mohan- Operations Research- Sultan Chand and Sons, 2014.
  • Sharma, S.D. (1997). Operation Research, Kedar nath Ramnath and Co. (Publishers)

 

 

REFERENCES: 

SUGGESTED READINGS.

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

E RESOURCES

 

 JOURNALS.

  • Journal of the Brazilian Computer Society, SpringerOpen
  • Journal of Internet Services and Applications, SpringerOpen

 

 

 

Academic Year: 
2022-23
  • Printer-friendly version