0% found this document useful (0 votes)
10 views2 pages

OR

The document outlines the course structure for 'Operation Research' (ILC6055), detailing course objectives, outcomes, and modules covering topics such as linear programming, transportation models, queuing theory, project management, inventory control, and decision theory. It includes assessment methods, referencing key textbooks and useful online resources. The total course duration is 42 hours, with evaluations comprising class tests and an end-semester exam.

Uploaded by

gdscuser02
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
10 views2 pages

OR

The document outlines the course structure for 'Operation Research' (ILC6055), detailing course objectives, outcomes, and modules covering topics such as linear programming, transportation models, queuing theory, project management, inventory control, and decision theory. It includes assessment methods, referencing key textbooks and useful online resources. The total course duration is 42 hours, with evaluations comprising class tests and an end-semester exam.

Uploaded by

gdscuser02
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Credits

Course Code Course Name


TH P TUT Total
ILC6055 Operation Research 03 -- -- 03

[Link] understand Research and Research Process


Course [Link] acquaint students with identifying problems for research and develop research
Objectives strategies
(COBs): [Link] familiarize students with the techniques of data collection, analysis of data and
interpretation
1. Define and formulate linear programming problems and solve them by applying
appropriate techniques.
2 Determining the optimum solution for transportation and Assignment models.
3 Choose the appropriate queuing model for a given practical application and propose
Course the best strategy and value of the given game model.
Outcomes 4. Use CPM and PERT techniques, to plan, schedule and control project activities.
(COs): Determining the optimum sequence to process jobs.
5. Judge classical & probabilistic inventory models and simulate different real life
probabilistic situation using Monte Carlo simulation technique.
6. Selecting the best strategy from various alternatives by applying various tools and
methodology for decision-making.

Total
Module No. & CO Hrs./
Sub Topics Hrs.
Name Mapped Subtopic
/Module
I. Prerequisite
and Course Prerequisite Concepts and Course Introduction - 01 01
Outline
1.1 Linear Programming: Problem formulation,
04
Graphical Method and simplex method.
[Link] 1.2 Artificial Variable Simplex Techniques: Big-M CO1 03 10
Programming Method and Two-Phase Method.
1.3 Advanced Topics in Linear Programming: Duality
03
in Linear Programming and the Dual Simplex Method.
2.1 Transportation Model: North-west corner method,
Row Minima method, Column Minima method, Least
[Link]
– cost method, Vogel’s Approximation method, 03
on models and
Optimality by MODI method and Unbalanced
Assignment CO2 06
Transportation Problem.
models
2.2 Assignment Model: The Hungarian method for
solution of Assignment problems, Unbalanced 03
assignment problem and maximization problem.
[Link] 3.1 Queuing Models: Introduction, Single-channel,
Model and Finite population model with Poisson Arrivals and CO3 03 06
Game Theory Exponential Service Times (Limited Source Model).

88
3.2 Game Theory, Saddle Point, Minimax (Maximin)
Method of Optimal strategies, Value of The Game.
Solution of Games with Saddle Points, Dominance 03
Principle. Rectangular Games Without Saddle Point –
Mixed Strategy for 2 x 2 Games.
4.1 Project Management: Phases of project
[Link] management, Network construction, Critical Path
analysis in Method (CPM) and Process Evaluation & Review 04
project Techniques (PERT). (Exclude Cost analysis, crashing,
CO4 07
planning and resource scheduling and updating)
Sequencing 4.2 Sequencing Models: Processing n jobs through one
models machine, two machines and three machines, Processing 03
n jobs through m machines.
5.1 Inventory Models: Introduction, Inventory models
[Link] with Deterministic demand (with and without 04
Control and shortages) and Inventory models with price breaks.
CO5 07
Simulation 5.2 Simulation: Definition, Types of Simulation
Models, Monte Carlo Technique, Practical Problems, 03
Applications in Queuing and Inventory problems.
Steps in Decision theory approach, Decision – Making
[Link] Environments, Decision making under conditions of
CO6 04 04
Theory certainty and uncertainty, Decision making under
conditions of Risk and Decision Trees.
II. Course Recap of Modules, Outcomes, Applications, and
_ 01 01
Conclusion Summarization.
Total hours 42

Books:
Reference 1. Taha, H.A. "Operations Research - An Introduction", Prentice Hall, (7th Edition),
Books 2002.
2. avindran, A, Phillips, D. T and Solberg, J. J. "Operations Research:
Principles and Practice", John Willey and Sons, 2nd Edition, 2009
3. Hiller, F. S. and Liebermann, G. J. "Introduction to Operations Research", Tata
McGraw Hill, 2002.
4. S. D. Sharma, Kedar Nath, Ram Nath “Operations Research”
5. Kanti Swarup, P. K. Gupta and Man Mohan, “Operations Research” Sultan Chand &
Sons
Useful Links: 1. [Link]
2. [Link]
Continuous  Test-1 and Test-2 (20 Marks):
Assessment  Test-1 and Test-2 consists of two class tests of 20 marks each.
(CA):  Test-1 is to be conducted on approximately 40% of the syllabus completed and Test-2
will be based on remaining contents (approximately 40% syllabus).both tests are
compulsorily.
End  End Semester Exam shall be conducted for Total 60 Marks.
Semester  Duration of End Semester Exam shall be 02 Hours and 30 Minutes.
Examination
(ESE):
89

You might also like