Probability and Decision Trees
Probability and Decision Trees
Probability and Decision Trees
HD LD P
LD HD P
HD HD P
3 . 0 ) & (
) (
46 13 LD LD P
b
a
High Demand
1.6m p.a for 3 years
Low demand
06mpafor 3years
High Demand
1.6m p.a for
3 years
Years 1 - 3 Years 4 - 6
1
2
3
0.7
0.71
0.29
D1
b
D2
c
OPTION A
Fully auto
(cost 5.4m)
OPTION B
0.6m p.a for 3 years
High Demand
16mpafor
OPTION C
Upgrade
(cost 2m)
Low demand
0.6m p.a for 6 years
High Demand
1.1m p.a for 3 years
Low demand
03mpafor 3years
4
1
2
3
0.3
0.71
0.29
e
D2
d
OPTION B
semi-auto
(cost 4m)
1.6m p.a for
3 years High Demand
0.5m p.a for 3 years
0.3m p.a for 3 years
Low demand
0.8m p.a for 3 years Low demand
0.8m p.a for 6 years
1
2
4
0.7
0.3
0.29
0.71
12
Analysis of decision tree Analysis of decision tree
The analysis is carried out out by rolling back from
node to node from RIGHT to LEFT, hence the term
BACKWARD PASS
EMV Node a=(0.71x1.6x3) +(0.29x0.6x3)
=3.408 +0.522
=RM3.93m
EMV Node b=(0.7((1.6x3)+3.93) +(0.3x0.6x6)
6111+108 =6.111 +1.08
=RM7.191m
Net EMV of OPTION A=7.191 - 5.4
=RM 1.791m
Analysis of decision tree Analysis of decision tree
EMV Nodec=(071x11x3) +(029x03x3) EMV Node c=(0.71x1.1x3) +(0.29x0.3x3)
=RM2.604m
Net EMV =2.604 - 2 =RM 0.604m
EMV Node d=(0.71x0.5x3) +(0.29x0.8x3)
=RM1.761m
EMV Node D2:
EMV Node c EMV Node d
Decision at D2: Not upgrade from OPTION B to
OPTION C
13
Analysis of decision tree Analysis of decision tree
EMV Nodee=(0.7((0.9x3) +1.761) EMV Node e (0.7((0.9x3) 1.761)
+(0.3x0.8x6)
=3.1227 +1.44
=RM 4.5627m
Net EMV of OPTION B =4.5627 - 4
=RM0.5627m
EMV Node D1:
EMV Node b = RM1.791m OPTION A
EMV Node e = RM0.5627m OPTION B
Decision at D1: To opt for OPTION A that is to install
the fully automatic machinery at the outset.