LP_1735886369154242657567778621f139a (1)

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

Course Type Course Code Name of Course L T P Credit

Core MSO301 Operations Research 3 0 0 9

Course Objective
In this course, one will be introduced to the decision-making process, optimization technique, linear
programming model, transportation and assignment problems, and queuing model using popular
business or industry problems. The goal of this course is to get learners familiar with the goals,
objectives, challenges, and constraint of the organization and the paradigms in creating a value for the
organization and customer to improve return on investment.
Learning Outcomes
 Build a culture of making informed decision process that facilitate multiple perspectives using
mathematical modelling techniques.
 To develop a brief understanding about the various mathematical techniques and understand
the dynamics to decide which one to use and how for a particular problem.
 To understand the basics of Linear Programming model, simplex algorithm and optimization
technique.
 To understand the application and importance of queuing model.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
1 Introduction to Operations Research and 3 Students will get to learn the
Mathematical Modelling relevance of operations
 Concept and applications in engineering research tools and techniques
and management domain to make informed decision in
 Principles of optimization technique an organization.
 Definition of feasible and optimal
solution.

2 Linear Programming 12 Students will learn the


 Relevance of linear programming and its different optimization
application techniques, linear model, their
 Formulation of Linear Programming significance in real-life
Problems problems and their solutions.
 Graphical Method, interpretation with They will learn to solve and
examples analyze linear problems using
 Algebraic Method graphical and algebraic
 Optimum Solution –Simplex Method, method with two or more
interpretation with examples decision variables.
3 Transportation Problems 8 Students will learn to analyze
 Transportation Problem as a special transportation problems as
case of Linear Programming Problem. special case of linear
 Finding the initial basic feasible programming problem and also
solution using North West Corner solving them for finding feasible
Method, Lowest Cost Entry Method and optimal solution using
and Vogel’s Approximation Method. various algorithms
 Finding optimal solution using MODI
and UV methods
 Unbalanced Transportation
Problems.
4 Assignment Problems 6 Student will learn to analyze
 Assignment Problem as a special case of assignment problems as special
Linear Programming Problem. case of transportation problem
 Hungarian Method and solve them to achieve
optimality using Hungarian
algorithm

5 Queuing Model 8 Student will learn the concepts


 Characteristics and parameters of queuing and parameters of queuing
model. model and they will understand
 Application of queuing analysis in decision its relevance and application in
making solving problems in uncertain
environment

6 Decision Making Process 5 Students will get to


 Decision making under risk and understand decision making
uncertainty under uncertainty and risk.

TOTAL 42

References for Reading

Textbooks:
1. Introduction to Operations Research, 9e, Frederick S. Hillier and Gerald J. Lieberman, McGraw-Hill
Ltd, 2010.
2. Quantitative Techniques in Management, 4e, N.D. Vohra, McGraw Hill Education (India) Pvt. Ltd.,
2011

Reference Books:
1. Operations Research, 10e, Hamdy A Taha, Pearson, 2016.

Evaluation criteria:

Mode of Examinations: Closed Book

Marks Breakup:
Mid Sem: 30%
End Sem: 50 %
Quiz 1 (before mid sem exam): 10%
Quiz 2 (after mid sem exam): 10%

You might also like