Professional Documents
Culture Documents
4. Let x1, x2 , and x3 be 0 - 1 variables whose values indicate whether the projects are not
done or are done. Which answer below indicates that at most one of the projects must
be done?
a. x1 + x2 + x3 > 1
*b. x1 + x2 + x3 < 1
c. x1 + x2 + x3 = 1
d. x1 + x2 = 0
*a. 3 x 2 x x d 7
1 2 3
b.
3x1 2 x 2 x3 d 7
d. 3x 2 x x d 7
1 2 3
9. In goal programming the decision variables representing deviations for soft constraints
a. Can be negative
*b. Are non-negative
c. Positive ones cancel negatives ones
d. Must be equal to 0 in the optimal solution
Questions 10, 11 and 12 refer to the following payoff table (in profits):
State of Nature
Alternative S1 S2
A1 75 -40
A2 0 100
Prior Probability 0.6 0.4
There is an option of paying $100 to have research done to better predict which state of nature
will occur. When the true state of nature is S1, the research will accurately predict S1 60% of
the time. When the true state of nature is S2, the research will accurately predict S2 80% of
the time.
10. What is the posterior probability of S1 given that the research predicts S1?
a. 0.18.
b. 0.44.
c. 0.57.
d. 0.65.
*e. 0.82
11. What is the posterior probability of S2 given that the research predicts S1?
*a. 0.18.
b. 0.44.
c. 0.57.
d. 0.65.
e. 0.82.
12. Given that the research is done and the information the research predicts S1, what is the
expected payoff using the EV decision rule?
a. -82.
*b. -46.
c. 0.
Demand Frequency
1 0.15
2 0.30
3 0.25
4 0.15
5 0.15
15. The simulation begins with the random number 0.6246. The simulated value would be:
a. 0.
b. 1.
*c. 2.
d. 3.
e. 4.
1. (25 points)
Simplon Manufacturing must decide on the processes to use to produce 1650 units. If
machine 1 is used, its production will be between 300 and 1500 units. Machine 2
and/or machine 3 can be used only if machine 1's production is at least 1000 units.
Machine 4 can be used with no restrictions.
SOLUTION:
Define the following variables.
Si – Indicator for whether or not to use machine i, i.e., S i=1 if machine i is used, and Si=0
otherwise; i = 1, 2, 3.
Ui – The production quantity by machine i; i=1,2,3.
K – Indicator for whether or not machines 2 and 3 are used
Formulation as follows:
a. For which values of p, if any, does Sharp Outfits minimize its expected total cost
by choosing to postpone shipping its customer orders via UPS?
b. Suppose now that, at a cost of $1,000, Sharp Outfits can purchase information
regarding the likelihood of a UPS strike in the near future. Based on similar strike
threats in the past, the probability that this information indicates the occurrence of
a UPS strike is 27.5%. If the purchased information indicates the occurrence of a
UPS strike, the chance of a strike actually occurring is 0.105/0.275. If the
purchased information does not indicate the occurrence of a UPS strike, the chance
of a strike actually not occurring is 0.680/0.725. Provided that p = 0.15, what
strategy should Sharp Outfits pursue to minimize its expected total cost?
c. Continuing part b. compute and interpret EVSI when p = 0.15.
d. Continuing part b. compute and interpret the EVPI when p = 0.15.
SOLUTION:
a.
S1 = Strike S2 = No strike
D1 = Now 60000 4000
D2 = Wait 10000 10000
p 1-p
b.
When p = 0.15, the expected cost for shipping now is (0.15)(60000) + (0.85)(4000) = 12400. So
wait is optimal with cost of 10000 without buying the information.
Decision tree:
.105
P S1 | I1 .381, P(S2 | I1) .619
.275
.68 .68
P S1 | I 2 .062, P( S 2 | I 2) .938
.275 .725
From the decision tree, the optimal policy will first buy information, and wait if the
information suggests a strike, or ship now if the information suggests no strike.
SOLUTION:
Then, the lottery “win $100 with probability .7 and $50 with probability .3” leads to
the expected utility
0.7U 100 0.3U 50 0.7 0.6U 200 0.4U 40 0.30.2U 200 0.8U 40
0.48U 200 0.52U 40
0.48U 200 0.02U 40 0.5U 40
0.48U 200 0.02U 200 0.5U 40
0.5U 200 0.5U 40
Thus Gary will prefer the lottery that win $200 with probability .5 and $40 with
probability .5.
4. (15 points)
Min 3x1 + x2
s.t. x1 + x2 4
2x1 x2 6
x1, x2 0 and integers
Below is the branch and bound tree for the problem. The nodes numbers reflect the
order by which the linear programming problems were solved. What are the values (or
fathoming information) of all boxes A to S?
x2 E x2 1
2 3
F z = 12 z = 11.5
LB = I
LB =
x1 = 4 x1 = 3.5
UB = G UB = J
x2 = 0 x2 = 1
H
x1 K x1 M
4 5
z= N LB = Q
Infeasible x1 = O
UB = R
x2 = P
L S
First solve the relaxation problem in node 1. Use the graphic method to get the optimal solution
(x1*,x2*) = (10/3, 2/3) and z* = 3*(10/3)+2/3 = 32/3. Then, A = 32/3, B=10/3, C=2/3, D=32/3;
Continue the branch & bound process and solve all the related relaxation problems, we have:
2 1 2 2
A 10 , B 3 , C , D 10
3 3 3 3
E " x2 0"
F 12, G 12
H Fathom
I 11.5, J 12
M 4
N 13, O 4, P 1, Q 13, R 12
S Fathom