Published on Computer Science & IT (https://www.csit.iisuniv.ac.in)

Home > Operations Research

Operations Research [1]

Paper Code: 
25CBDA511
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

 

 

 

 

 

 

 

 

 

 

 

 

25CBDA

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: 

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 READINGS:

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

3.   http.//ecoursesonline.iasri.res.in/course/view.php?id=104

4.   https.//www.engineeringenotes.com/project-management-2/operations- [2] research/assignment-problem-meaning-methods-and-variations-operations- research/15652

5.   https.//www.geeksforgeeks.org/transportation-problem-set-6-modi-method-uv- [3] method/

6.   https.//www.geeksforgeeks.org/hungarian-algorithm-assignment-problem-set-1- [4] introduction/

7.   http.//www.universalteacherpublications.com/univ/ebooks/or/Ch6/hungar.htm [5]

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: 
2025-26 [6]

Follow Computer Science & IT on:

IIS (Deemed to be University)

Gurukul Marg, SFS, Mansarovar, Jaipur 302020, (Raj.) India Phone:- +91-141-2400160-61, 2397906-07, Fax: 2395494, 2781158

Source URL: https://www.csit.iisuniv.ac.in/courses/subjects/operations-research-3

Links:
[1] https://www.csit.iisuniv.ac.in/courses/subjects/operations-research-3
[2] http://www.engineeringenotes.com/project-management-2/operations-
[3] http://www.geeksforgeeks.org/transportation-problem-set-6-modi-method-uv-
[4] http://www.geeksforgeeks.org/hungarian-algorithm-assignment-problem-set-1-
[5] http://www.universalteacherpublications.com/univ/ebooks/or/Ch6/hungar.htm
[6] https://www.csit.iisuniv.ac.in/academic-year/2025-26