Question 5.s-7: Computing the Expected Value of Perfect Information Using Ex...
Computing the Expected Value of Perfect Information Using Expected Regret
Determine the expected value of perfect information for the capacity-planning problem using the expected regret approach.
The blue check mark means that this solution has been answered and checked by an expert. This guarantees that the final answer is accurate.
Learn more on how we answer questions.
Learn more on how we answer questions.
Using information from Examples 5S–2, 5S–3, and 5S–4, we can compute the expected regret for each alternative. Thus:
Small facility .30(0) + .50(2) + .20(6) = 2.2
Medium facility .30(3) + .50(0) + .20(4) = 1.7 [minimum]
Large facility .30(14) + .50(10) + .20(0) = 9.2
The lowest expected regret is 1.7, which is associated with the second alternative. Hence, the EVPI is $1.7 million, which agrees with the previous example using the other approach.
Related Answered Questions
Question: 5.p.5
Verified Answer:
The attainable output of each portion of the syste...
Question: 5.p.6
Verified Answer:
a.
New
Bridge
No New
Bridge
Maximin
(worst)
M...
Question: 5.p.5
Verified Answer:
Using Formula 5S-1, the EVPI is the expected payof...
Question: 5.p.4
Verified Answer:
a. A: .60(1) + .40(14) = 6.20 [best]
B: .60(2) + ....
Question: 5.p.3
Verified Answer:
To obtain the regrets, subtract all payoffs in eac...
Question: 5.p.2
Verified Answer:
Plot a straight line for each alternative. Do this...
Question: 5.p.1
Verified Answer:
New
Bridge
No New
Bridge
Maximin
(worst)
Maximax
(...
Question: 5.s-8
Verified Answer:
First, plot each alternative relative to P(2). To ...
Question: 5.s-6
Verified Answer:
First, compute the expected payoff under certainty...
Question: 5.s-5
Verified Answer:
The dollar amounts at the branch ends indicate the...