19MEE306 OPERATIONS

RESEARCH
Course teacher : Dr. Gokulachandran J
Professor and Vice Chairman
Department of Mechanical Engg
 Department of Mech Engg
Name of the Course
19MEE306 OPERATIONS RESEARCH

Class/Semester/ YEAR BTech/V/2024-25

Course Mentor Dr. Gokulachandran J ( A section)
Associated Faculty Members Mr Pushparajan M/ Dr Sumesh A
Course Objectives & Outcomes
Main Objectives of Course

 Familiarizing the students with quantitative tools and techniques, which are
frequently applied in operational decisions

Course Outcomes

At the end of the course the students should be able to

 CO1: Formulate operations research models to optimize resources.

 CO2: Solve transportation and assignment problems using suitable techniques.
 CO3: Apply appropriate technique to analyze a project with an objective to
optimize resources.
 CO4: Solve operational problems using decision theory approaches.
 CO5: Select suitable inventory model for effective utilization of resources.
 CO6: Solve Operations Research problems using software package
Syllabus
Unit1
Linear Programming: Formulations - graphical solutions - Simplex Method - Duality, Dual simplex method. Transportation
model: Assignment model – Travelling Salesman Problem.
Unit 2
Decision Theory: Decision Trees. Game theory - 2 person zero sum; mixed strategies; 2 x n and m x 2 games. Network
Models- Project Networks- CPM / PERT- Project Scheduling – crashing networks and cost considerations Resource
leveling and smoothing - shortest route problem, minimal spanning tree problem, maximal flow problem.
Unit 3
Sequencing model – 2 machines ‘n’ jobs, ‘m’ machines ‘n’ jobs – n jobs 2 machines. Inventory models: deterministic &
probabilistic models. Quantity discounts. Selective Inventory Management Queuing models: Poisson arrival and
exponential service times. Single server, multi-server. Queues -infinite and finite capacity queues. Simulation –Monte
Carlo simulation: simple problems
Lab session: Practicing case problems with excel solver/Mat Lab/LINGO package
TEXT BOOK:
1. Wagner, H.M., ‘Principles of Operations Research’, Prentice Hall, New Delhi, 1998.
REFERENCES:
2. J.K. Sharma, “ Operations Research Theory and Applications”- Macmillan IndiaLtd,New Delhi-2013-5 th Edition
3. Taha H.A., ‘Operations Research: an Introduction’, 8e, Prentice HalI, New Delhi, 2010-9 th Edition.
4. Ravindran, A., Phillips, D.J., and Solberg, J.J., ‘Operations Research- Principles and Practice’, John Wiley & Sons, 2005.
5. Hardley, G.,‘Linear Programming’, Narosa Book Distributors Private Ltd 2006.

NPTEL http://nptel.ac.in( Prof. G. Srinivasan, IIT Chennai)

CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 3 2 2 2 1 2 3 3 2
CO2 3 2 2 2 1 2 3 3 2
CO3 3 2 2 2 1 2 3 3 2
CO4 3 2 2 2 1 2 3 3 2
CO5 3 2 2 2 1 2 3 3 2
CO6 3 2 2 2 1 2 3 3 2
Lesson plan

Lecture Topics Key-words Objectives

No.

1 General introduction to OR Model, problem formulation, solution To highlight the history and nature of OR and to give an overview of a few of
the OR techniques and their applications.

2 Linear Programming Objective function, constraints, To teach the art and science of problem formulation and representing a
decision variables given problem mathematically by a set of objective function and constraints.

3-4 Graphical method Maximization, minimization, To teach solutions for problems using graphical method, special cases like
constraints, feasible region, infeasible multi optimal solution.
region, unbounded solution,
redundant constraints

5-10 Simplex method Slack variables, surplus variables, To teach simplex method for solving LP problems, its variations, tackling
artificial variables, simplex method, different constraint forms and degeneracy. Product –mix problem, diet
Big-M method, 2 phase method, problem, blending problem etc.
Degeneracy, linear programming

11-12 Duality theory Duality, Primal problem, dual To teach solving a primal problem using a dual and vice versa.
problems

13-16 Transportation problem(TP) Minimization, maximization, Mathematical representation of TP,

degeneracy, Northwest corner To teach solving transportation problems using transportation algorithm,
method, Vogel’s approximation treatment of degeneracy, maximization problem.
method
 Mathematical representation of AP,
17-19 Assignment Maximization, minimization To teach solving assignment problems using assignment
Problem(AP) algorithm

20-24 Network PERT/CPM, critical path, slack, To teach to draw networks relating to projects, determination of
analysis(Project float, optimistic time, pessimistic critical path and project duration , probability of completion of
management) time, most likely time, crashing, project in a given duration, crashing networks, manpower
resource allocation, direct cost, leveling, resource leveling
over heads, deterministic,
probabilistic activity duration

25 Minimal Spanning tree Node, Branch, network To teach the technique to solve minimal spanning tree problem.
problem
26-28 Shortest route problems Examples, Shortest route To teach how to determine the shortest route between a source
algorithms, Linear programming and a destination
formulation

29-32 Inventory models Deterministic inventory models, To teach the different models of inventory to find out EOQ and
Classical EOQ and EOQ with price optimum cost.
breaks
33-35 Sequencing models Jobs, Machines To teach how to find optimum sequence of Jobs and optimum time on machines

36-38 Queueing models Arrival rate, service rate, Poisson arrivals, To teach solving M/M/1 queue to determine queue characteristics (Lq, Ls, Ws, Wq )
Exponential service time, single server, Multi
server

39-41 Decision analysis Decision making under uncertainty, Decision To teach the process involves selecting the best among several decisions through a
making under risk, EMV, EOL, EVPI proper evaluation of the parameters of each decision environment

42-44 Game theory – Two person zero sum games, Maximin- and To understand about the decision making in competitive situations where there are two
2 person zero sum; mixed Minimax problems, Games without saddle or more opposing parties with conflicting interests and the action of one depends on
strategies; 2 x n and m x 2 points-mixed strategies, 2 x n and m x 2 the action taken by the opponent.
games. games, dominance property n x n games

45-46 Simulation Random number generation, Monte To understand simulation technique in solving business problems (Viz., Inventory and
carlo technique Queuing model)

Lab session
47-51 Practicing problems on Linear programming Attempts to maximize or minimize a linear function of decision variables

52-56 Practicing problems on Transportation To determine the optimum routes to minimize shipping costs from supply source to
destinations
Practicing problems on Assignment and TSP To assign a number of resources to an equal number of activities at min cos or max
57-59 profit
60-62 Practicing problems on Network analysis To predict the duration of projects.
63-65 Practicing problems on Inventory models To forecast inventory based on demand, cost price and consumption.

66-68 Practicing problems on Sequencing models To select appropriate order of jobs to service facilities for optimizing time, cost or profit

69-70 Practicing problems on Queuing models To select the appropriate model based on service pattern and arrival pattern

71-75 Practicing problems on Decision model , game theory and simulation To make suitable decision based on market situation
End exam
Evaluation component

Component Weightage Remarks

Continuous Internal Examination (CIE) Evaluation Components (60%)

Midterm (theory) 30

CA (Lab Evaluations) 30 4 test(theory + lab) and record submission

Semester End Examination (SEE) Components (40%)
End exam (Theory) 40
Course beginning date 10-07-2024

Mid term 06-09-2024( Tentative)

Course Ending date 8-11-2024(Tentative)

Decision Making
Operations Research
1 Orgin of OR
2 Definitions
3 Scope/Purpose of OR
4 Characteristics of OR
5 Phases/Stages of OR
6 Advantages of OR
7 Applications
8 Limitations
ORGIN-OR

Developed during II world war

-Developed by military management
Problem faced
-Usage of military equipment
-Manpower allocation
-Supplying food
Definitions-OR

1. OR is the application of the methods of mathematical science

to complex problems arising in the direction and management
of large systems of men, machines, materials and money in
industry
2. OR is a scientific approach to problem solving for executive
management
3. OR is the art of winning war without actually fighting
Scope- OR
1. OR is very useful to the top management in deciding optimum
allocation of various limited sources such as men, machines, time,
money, space etc
2. OR has been useful to the production and design specialists
3. OR is useful in marketing decisions
4. OR is useful to the financial controller
5. OR is useful to the personnel executive
Characteristics of OR
1. It is mixed team approach to find out optimum solution
2. OR is the inter disciplinary team approach to find out the
optimum return
3. OR tries to optimize the total output by maximizing the profit
and minimizing the loss or cost
4. OR gives optimal solution not perfect solution
Phases/stages of OR
1. Identification of the problem
2. Formulating the problem
3. Constructing a model
4. Selecting appropriate input data
5. Deriving the solution
6. Testing the model and solution
7. Implementation
Advantages- OR
1. Economic use of resources
2. Better quality of decision
3. Different optimum solutions are available
4. OR Models serve a useful tool for new research and
development
Applications- OR

1. Allocation problems
2. Transportation problems
3. Assignment problems
4. Sequencing problems
5. Inventory problems
6. Decision making problems
7. Network problems
Limitations-OR

1. Difficult to define OR precisely

2. OR models do not give perfect solution

3. Difficult to formulate the complex problems

How will you assign given Task to
Person ?
5 programs and 4 Programmers
 Assignment problem
Program1 Program2 Program3 Program4 Program5
Programmer 1 3 5 4 6 3

Programmer 2 4 6 5 7 4

Programmer 3 2 4 3 5 2

Programmer 4 5 6 7 8 9
Thank You