Scribd
Upload
23 views2 pages

Syllabus

Uploaded by

Ms.V.Nalini Assistant Professor
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
23 views2 pages

Syllabus

Uploaded by

Ms.V.Nalini Assistant Professor
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

L T P C Hours

22UCB603 OPERATIONS RESEARCH


3 0 0 3 45

Common to NIL
Prerequisites: Linear Algebra
Course objectives: This course aims to
 Acquaint theoretically and graphically the optimization solution of LPP
 Study the different techniques to solve transportation problem
 Learn the various methods to solve assignment problem
 Identify and solve problems under Markovian queuing models.
 Obtain a solution to network problems using CPM and PERT techniques.
UNIT I LINEAR PROGRAMMING 9
Introduction-Meaning and scope of Operations Research-Use and limitations of Operations
Research –Introduction of Linear Programming Problem (LPP)- Formulation of LPP-Procedure for
solving LPP by Graphical solution – Simplex Algorithm- Simplex method Problems.

UNIT II TRANSPORTATION PROBLEM 9


Definition-Feasible solution for balanced and unbalanced transportation problem: North-West
corner rule-Matrix Minima Method (Least Cost)-Vogel’s Approximation Method(VAM) -Optimal
solution through MODI method.

UNIT III ASSIGNMENT PROBLEM 9


Definition–Mathematical Formulation- Difference between Transportation and assignment
Problems-unbalanced assignment problem- Hungarian method- Travelling salesman problem.
UNIT IV PROJECT SCHEDULING 9
Project network -Diagram representation – Floats - Critical path method (CPM) – PERT- Cost
considerations in PERT and CPM.
UNIT V QUEUING MODELS 9
Introduction-Queuing Theory-Operating characteristics of a Queuing system-Constituents of a
Queuing system-Service facility-Queue discipline-Single channel models-multiple service channels.
Course outcomes: At the end of the course, students will be able to
CO1: Implement linear programming problems using appropriate techniques and interpret the
results obtained.
CO 2: Optimize the solution for the transportation problem
CO 3: Solve the Assignment Problem with its various methods
CO 4: Apply project management tools: network diagrams, CPM, and PERT for effective project
management.
CO 5: Understand the fundamental concepts of queuing theory and its practical applications.
Text Book:
[1] Hamdy A Taha, Operations Research: An Introduction, Pearson, 10th Edition, 2017
[2] ND Vohra, Quantitative Techniques in Management, Tata McGraw Hill, 4th Edition, 2017
[3] Hiller F.S, Liberman G.J, Introduction to Operations Research, 10th Edition McGraw Hill, 2017.
Reference Books:
[1] D.S. Hira and P.K. Gupta, Operations Research, (Revised Edition), Published by S. Chand &
Company Ltd, 2015.
[2J.JK. Sharma,” Operations Research: Theory and Applications”, Laxmi publications, Sixth Edition,
2017.
[3] S. D Sharma, Operation Research, Kedarnath Ram Nath Publishers,2020.
Web references:
 https://archive.nptel.ac.in/courses/112/106/112106134/
 https://archive.nptel.ac.in/courses/111/107/111107128/
 https://archive.nptel.ac.in/courses/110/106/110106062/

COURSE ARTICULATION MATRIX


Course Programme Outcomes/Programme Specific Outcomes (POs/PSOs)
Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 1 - - - - - - - 3 2
CO2 3 2 1 - - - - - - - 3 2
CO3 3 2 1 - - - - - - - 3 2
CO4 3 2 1 - - - - - - - 3 2
CO5 3 2 1 - - - - - - - 3 2
Average 3 2 1 - - - - - - - 3 2
1. Slight (Low) 2. Moderate (Medium) 3. Substantial (High)

You might also like