HUMANITIES II (OPERATIONS RESEARCH) - HM-HU601.pdf

ppt on Operations Research techniques and tools

1. HUMANITIES II (OPERATIONS RESEARCH )
OPERATIONS RESEARCH
TECHNIQUES AND TOOLS
SUB. CODE -HM –HU601
Presented by
SOUVIK DEY
ROLL 34300721018
B.TECH (ME) –6
TH
SEM
HEMNALINI MEMORIAL COLLEGE OF ENGINEERING

2. WHAT IS OPERATIONAL RESEARCH?
Operational Research is a systematic and analytical approach to decision making.
It is a branch of APPLIED MATHEMATICS that uses techniques and statistics to arrive at
optimal solutions to solve complex problems.
It is typically concerned with determining the maximum profit, sale, output, crops yield
and efficiency and minimum losses, risks, cost and time of some objective functions. It
has also become an important part of INDUSTRIAL ENGINEERING PROFESSION.
Some of the PRIMARY TOOLS used by operation researchers are –
Statistics
Game Theory
Probability Theory etc.

3. METHODOLOGIES / APPROACHES OF
OPERATIONAL RESEARCH
ORIENTATION
PROBLEM DEFINITION
DATA COLLECTION
MODEL FORMULATION
SOLUTION
ANALYSES AND INFORMATION
IMPLEMENTATION AND MONITORING

4. TECHNIQUES AND TOOLS OF OPERATIONAL
RESEARCH

5. LINEAR PROGRAMMING
This is a constrained optimization technique, which optimize some criterion within
some constraints. In Linear programming the objective function (profit, loss or return
on investment) and constraints are linear. There are different methods available to
solve linear programming.
NON -LINEAR PROGRAMMING
This is used when the objective function and the constraints are not linear in nature.
Linear relationships may be applied to approximate non -linear constraints but limited to
some range, because approximation becomes poorer as the range is extended. Thus, the
non-linear programming is used to determine the approximation in which a solution lies
and then the solution is obtained using linear methods.

6. INTEGER PROGRAMMING
If one or more variables of the problem take integral values only then dynamic
programming method is used. For example number or motor in an organization, number
of passenger in an aircraft, number of generators in a power generating plant, etc.
TRANSPORTATION
The Transportation Problem is a special type of Linear programming problem in which
goods are transported from a set of sources to a set of destinations subject to the supply
and demand of the source and destination, respectively, such that the total cost of
transportation is minimized.

7. DYNAMIC PROGRAMMING
Dynamicprogramming isamethodofanalyzingmultistagedecisionprocesses.Inthis
eachelementarydecisiondependsonthoseprecedingdecisionsandaswellasexternal
factors
GAME THEORY
Thisisusedformakingdecisionsunderconflictingsituationswherethereareoneor
moreplayers/opponents.Inthisthemotiveoftheplayersaredichotomized.Thesuccess
ofoneplayertendstobeatthecostofotherplayersandhencetheyareinconflict.
DECISION THEORY
Decisiontheoryisconcernedwithmakingdecisionsunderconditionsofcomplete
certaintyaboutthefutureoutcomesandunderconditionssuchthatwecanmakesome
probabilityaboutwhatwillhappeninfuture.

8. QUEUING THEORY
Thisisusedinsituationswherethequeueisformed(forexamplecustomerswaitingfor
service,aircraftswaitingforlanding,jobswaitingforprocessinginthecomputer
system,etc).Theobjectivehereisminimizingthecostofwaitingwithoutincreasingthe
costofservicing.
SIMULATION
Simulationisaprocedurethatstudiesaproblembycreatingamodeloftheprocess
involvedintheproblemandthenthroughaseriesoforganizedtrialsanderrorsolutions
attempttodeterminethebestsolution.Sometimesthisisadifficult/timeconsuming
procedure.Simulationisusedwhenactualexperimentationisnotfeasibleorsolutionof
modelisnotpossible.

9. MARKOV PROCESS
Markovprocesspermitstopredictchangesovertimeinformationaboutthebehaviorof
asystemisknown.Thisisusedindecisionmakinginsituationswherethevariousstates
aredefined.Theprobabilityfromonestatetoanotherstateisknownanddependson
thecurrentstateandisindependentofhowwehavearrivedatthatparticularstate.
INFORMATION THEORY
Thisanalyticalprocessistransferredfromtheelectricalcommunication fieldtoO.R.
field.Theobjectiveofthistheoryistoevaluatetheeffectivenessofflowofinformation
withagivensystem.Thisisusedmainlyincommunication networksbutalsohas
indirectinfluenceinsimulatingtheexaminationofbusinessorganizationalstructure
withaviewofenhancingflowofinformation.

10. NETWORK SCHEDULING
Thistechniqueisusedextensivelytoplan,schedule,andmonitorlargeprojects(for
examplecomputersysteminstallation,R&Ddesign,construction,maintenance,etc.).
Theaimofthistechniqueisminimizetroublespots(suchasdelays,interruption,
productionbottlenecks,etc.)byidentifyingthecriticalfactors.Thedifferentactivities
andtheirrelationshipsoftheentireprojectarerepresenteddiagrammaticallywiththe
helpofnetworksandarrows,whichisusedforidentifyingcriticalactivitiesandpath.
Therearetwomaintypesoftechniqueinnetworkscheduling,theyare:
Program Evaluation and Review Technique (PERT)
isusedwhenactivitiestimeisnotknownaccurately/onlyprobabilisticestimateoftime
isavailable.
Critical Path Method (CPM)
isusedwhenactivitiestimeisknowaccurately

11. THANK YOU!
REFERENCES :
https://prinsli.com/techniques-of-operation-research/
www.bbau.ac.in/dept/UIET/EMER-601%20Operation%20Research%20Queuing%20theory.pdf