Q4 Time Students should have control over their time.

Good time
management management enables them to work smarter – not harder.
They get more done in less time, even when time is tight
and pressures are high. Failing to manage their time
damages their effectiveness and causes stress.

1. Students should come to classes in time. No entry for

latecomers
2. Students should submit the assignments within the due
time. Late submissions are not entertained.
Missing deadlines, poor work quality, poor
professionalism are the
indicators of poor time management. Procrastination is
the most obvious
result of poor time management

****
Name of CCPC member CCPC member signature HoD Signature
Dr. K. Shiva Shankar (Chairman)

Dr. Prabhakar Rao (Convener) Dr.K. Shivashanker

Sri. E. Suresh (Member) HoD, M&H
Dr. R. Ramesh (Member)

Date: 17.05.2021
 U18OE803A - OPEARTIONS RESEARCH
Class: B. Tech.VIII – Semester Branch(s): All branches
Teaching Scheme: Examination Scheme:
L T P C
3 – – 3

Continuous Internal Evaluation 40 marks

End Semester Examination 60 marks

Course Learning Objectives:

This course will develop students’ knowledge in/on
LO1: concepts to solve linear programming problems which arise in real life using various methods and their advantages
LO2: applications of linear programming namely transportation and assignment problems which arise in different engineering
fields.
LO3: non-linearity
linearity in optimization problems, direct search techniques and iterative methods.
LO4: various queuing systems and their practica
practical relevance.
UNIT – I(9)
Linear Programming Problem (LPP): Mathematical models and basic concepts of linear programming
problem; Solution of linear programming problem - Graphical method, Simplex method, Artificial variable
techniques (Big-M and Two-phase
phase method), Duality in linea
linearr programming, dual simplex method.
UNIT – II (9)
Special types of LPP: Mathematical model of transportation problem, Methods of finding initial basic
feasible solution, optimal solution of transportation problem, Degeneracy in transportation problem;
Exceptional
ptional cases in transportation problem
problem- Unbalanced transportation problem, Maximization
transportation problem; Assignment problem-
problem Mathematical formulation of the problem, Hungarian
method to solve an assignment problem, Special cases in assignment prob
problem- Maximization assignment
problem.
UNIT – III (9)
Non-linear
linear Programming Problem (NLPP): Classical method of optimization using Hessian matrix;
Iterative methods - Random search methods
methods-Random
Random jump method, Random walk method, Steepest
decent method and Conjugate gradient method; Direct methods - Lagrange’s method, Kuhn
Kuhn-Tucker
conditions.
UNIT – IV (9)
Queueing Theory: Queueing system-- Elements and operating characteristics of a queuing system;
Probability distributions in queueing systems
systems- Distribution off arrivals (Pure Birth Process); Classification of
queueing models; Poisson queueing systems-
systems Study of various characteristics of single server queuing
model having infinite population and single server queuing model having finite
population , Generaliz
Generalized model (Birth-Death process).

Textbooks:
[1]. Kanti Swarup, P.K. Gupta, Manmohan Operations Research, 16th ed., New Delhi: S. Chand & Sons, 2013.
(Chapters 2,3,4,6,7,13,17)
[2]. Singiresu S. Rao, Engineering Optimization Theory and Practice
Practice, 4th ed., Hoboken, New Jersey: John Wiley &
 Sons, Inc, 2009 (Chapters 6)
Reference Books:
[1]. Hamdy. A. Taha, Operations Research, 7th ed., New Delhi: Prentice Hall of India Ltd, 2002.
[2]. J.C. Pant, Introduction to Optimization, 7th ed., New Delhi: Jain Brothers, 2012.

Course Research Papers: Research papers (Journal/Conference papers) relevant to the course content will be posted
by the course faculty in CourseWeb page
Course Patents: Patents relevant to the course content will be posted by the course faculty in CourseWeb page
Course Projects: Course project is an independent project carried out by the student during the course period, under
the supervision of course faculty. Course faculty will post few course projects titles in CourseWeb page.
Students are encouraged to come up and experiment with the ideas that interest them.

Course Learning Outcomes (COs):

On completion of this course, the students will be able to…
CO1: model engineering real time problems and solve them using various LPP techniques
CO2: obtain the optimal solution of transportation, assignment problems and their real time applications
CO3: optimize the engineering problems using NLPP techniques
CO4: differentiate various queueing models and their practical relevance

Course Articulation Matrix: U18OE803A - OPEARTIONS RESEARCH

PO PO PO PO PO PO PO PO PO PO PO PO
CO PSO 1 PSO 2
1 2 3 4 5 6 7 8 9 10 11 12
U18OE803A.1
CO1 2 2 - - - - - - - 1 - 1 - -

U18OE803A.2
CO2 2 2 - - - - - - - 1 - 1 - -

U18OE803A.3
CO3 2 2 - - - - - - - 1 - 1 - -

U18OE803A.4
CO4 2 2 - - - - - - - 1 -- 1 - -

U18OE803A
2 2 - - - - - - - 1 1 - -
 COURSE ARTICULATION MATRIX: JUSTIFICATION
COs POs Justification for mapping (Student will be able to) Level of
/PSOs mapping
CO1 PO1 Apply various Linear programming techniques to solve 2
model engineering real complex engineering problems
time problems and solve PO2 Identify, formulate and analyze various complex engineering 2
them using various LPP problems and solve them using various linear programming
techniques techniques.
PO10 Comprehend and write effective reports on optimization 1
problems using various linear programming techniques.
PO12 Recognizes the need of linear programming techniques in the 1
broadest context of technological change
CO2 PO1 Solve various complex engineering problems of transportation 2
obtain the optimal and assignment using optimization techniques.
solution of PO2 Identify, formulate and analyze various complex engineering 2
transportation, problems of transportation and assignment and solve them
assignment problems using optimization techniques.
and their real time PO10 Comprehend and write effective reports on transportation and 1
applications assignment problems
PO12 Recognizes the need of transportation and assignment 1
problems in the broadest context of technological change
CO3 PO1 Apply various Nonlinear programming techniques to solve 2
optimize the complex engineering problems
engineering problems PO2 Identify, formulate and analyze various complex engineering 2
using NLPP techniques problems and solve them using various nonlinear
programming techniques
PO10 Comprehend and write effective reports on optimization 1
problems using nonlinear programming techniques.
PO12 Recognizes the need of nonlinear programming techniques in 1
the broadest context of technological change
CO4 PO1 Apply various queueing models solve complex engineering 2
differentiate problems
various queueing PO2 Identify, formulate and analyze various queueing models and 2
models and their their practical relevance
practical relevance PO10 Comprehend and write effective reports on various queueing 1
models and their practical relevance
PO12 Recognizes the need of various queueing models and their 1
practical relevance in the broadest context of technological
change