Unlock access to all the studying documents.
View Full Document
Chapter 05S – Decision Theory
5S–21
11. Decision Tree
Alternative A
.20
60
D2b
1/3
50
5
44
40
4
EV=46
1) Determine the product of the chance probabilities and their respective payoffs for the
branches on the right hand side. Because this is a complex problem, we have added labels
to the circles:
2) Determine which alternative would be selected for each possible second decision. We
have labeled these D2a, D2b, and D2c.
D2a: Select upper branch with payoff of 50. Draw a double slash through the lower
branch.
Chapter 05S – Decision Theory
5S–22
3) Determine the product of the chance probabilities and their respective payoffs for the
branches on the left hand side. Because this is a complex problem, we have added labels
to the circles:
4) Determine the expected value of each initial alternative.
12. a.
1) Draw the tree diagram. Because the probabilities are unknown, we would assume that
each state of nature has an equal probability of occurring.
2) We have to make a choice for the possible second decision before proceeding.
Expand has a higher payoff than Lease ($500 > $100). Select Expand. Draw a double
slash through the Lease branch.
5S–23
b. Use the tree diagram to identify the choice that you would make using each of the four
approaches for decision making under uncertainty.
1) Maximax: Determine best possible payoff for each alternative and choose the
alternative that has the “best.”
Conclusion: Select Build Large with a payoff of $2,000.
2) Maximin: Determine the worst possible payoff for each alternative and choose the
alternative that has the “best worst.”
Conclusion: Select Build Small alternative with a payoff of $500.
Chapter 05S – Decision Theory
5S–24
3) Laplace: Determine the average payoff for each alternative and choose the alternative
with the best average.
Conclusion: Select Build Large alternative with an average payoff of $1,020.
4) Minimax Regret: Prepare a table of regrets (opportunity losses)—for each column,
subtract every payoff from the best payoff in that column. Identify the worst regret for
each alternative. Select the alternative with the “best worst.”
Chapter 05S – Decision Theory
5S–25
13. Given: We have the estimated costs for various alternatives and caseloads shown below.
alternative that has the “best worst.”
Conclusion: Select New staff alternative.
Chapter 05S – Decision Theory
5S–26
b. Maximax: Determine best possible payoff for each alternative and choose the alternative
that has the “best.”
Conclusion: Select Redesign collection alternative.
c. Minimax Regret: Prepare a table of regrets (opportunity losses)—for each column,
subtract every payoff from the best payoff in that column. Identify the worst regret for
each alternative. Select the alternative with the “best worst.”
Conclusion: Select New Staff alternative.
Chapter 05S – Decision Theory
5S–27
d. Laplace: Determine the average payoff for each alternative and choose the alternative with
the best average.
Conclusion: Select either New Staff or Redesign collection alternative.
14. Given: Probabilities for states of nature are now given as follows: .10 for moderate, .30 for
high, and .60 for very high.
a. Minimum expected cost:
.10(50) + .30(60) + .60(85) =
.10(60) + .30(60) + .60(60) =
.10(40) + .30(50) + .60(90) =
Conclusion: New Staff alternative will yield the minimum expected cost.
Chapter 05S – Decision Theory
5S–28
c. Opportunity loss table
Expected regret for each alternative:
Reassign: .10(10) +.30(10) + .60(25) = 19
New staff: .10(20) +.30(10) + .60(0) = 5
Chapter 05S – Decision Theory
15. a. Given: Payoffs (profits) are provided in the table below.
Plot each alternative relative to P(1). Plot the payoff value for #2 on the left side of the
graph and the payoff value for #1 on the right side of the graph.
Equations:
A: 20 + 100P (slope = 120 – 20)
B: 40 + 20P (slope = 60 – 40)
Find the intersection between C & D:
110 – 100P = 90 + 0P
-100P = 90 – 110
5S–30
Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of
McGraw-Hill Education.
Find the intersection between D & A:
90 + 0P = 20 + 100P
90 – 20 = 100P
70 = 100P
P = 70/100
P =.7000
Optimal ranges:
A: P(#1) > .7000 to 1.00
b. Treat the payoffs as costs.
Alternative A is best for the lowest range of P(#1), followed by Alternative B for the
intermediate range, and then Alternative C for the highest range.
Equations: