Unit 17 Risk Decision Making
Unit 17 Risk Decision Making
Table of contents
Decision making
Decision trees
1
10/16/2017
Decision-maker knows the probability of occurrence EMV for a course of action is the sum of the
of each states of nature. products obtained by multiplying the payoff for
a given outcome by its probability value.
Models are called probabilistic models. For example:
◦ If m1, m2,….,mn, are the payoffs corresponding to the
states of nature S1, S2,.....,Sn respectively. If the
◦ Queuing theory models corresponding probabilities of S1, S2,...,Sn are
◦ Simulation models p1, p2,...,pn , then the EMV is defined as:
◦ Probabilistic inventory models
◦ Some of the replacement models ◦ EMV = m1 p1+ m2 p2+….mn pn = ∑mp
◦ Genetic programming
Risk & Decision Making 11 Risk & Decision Making 12
2
10/16/2017
3
10/16/2017
◦ Laplace criterion
4
10/16/2017
The company should go for full product line The company should go for minimal product
under maximaxi criteria. line under maximaxi criteria.
Risk & Decision Making 25 Risk & Decision Making 26
A graphical representation of the multistage The decision tree has 2 types of nodes:
decision problem can be made by using a ◦ Square represents decision point. Numbers of
decision tree. alternatives are available at decision point where
decisions are taken to maximize the return.
A decision tree is a simple graphic device which
◦ Circle represents chance of an event.
enables the decision maker to understand more
clearly the alternative options along with risks
associated with each of them. Decision tress are useful for finding the optimal
alternative.
Risk & Decision Making 29 Risk & Decision Making 30
5
10/16/2017
Example 4-Solution
◦ Expected revenue at node 2: (600*0.6) + (700*0.4)
= 640 M