SOLUTIONS MANUAL for Stochastic Modeling: Analysis and ...
SOLUTIONS MANUAL for Stochastic Modeling: Analysis and ...
SOLUTIONS MANUAL for Stochastic Modeling: Analysis and ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
59<br />
Pr{≤ 1 defective} = a + b + c +13d<br />
= p 12<br />
11(π 1 p 2 11 + π 2 p 21 p 11 + π 1 p 11 p 12<br />
+13π 1 p 12 p 21 )<br />
= p 12<br />
11(π 1 (p 2 11 + p 11 p 12 +13p 12 p 21 )+<br />
π 2 p 21 p 11 )<br />
For (6.11) this ≈ 0.9169<br />
For 16(a) this ≈ 0.1299<br />
Notice that the Markov-chain model gives a lower probability of accepting a good<br />
process, <strong>and</strong> a higher probability of accepting a bad process.<br />
17. (a) M = {1, 2, 3, 4} = {A, B, C, D} is the location of the AGV<br />
n represents the number of trips<br />
(b) p (5)<br />
24 ≈ 0.1934<br />
(c) π 4 =3/16 = 0.1875<br />
⎛<br />
P = ⎜<br />
⎝<br />
0 1/2 1/2 0<br />
1/3 0 1/3 1/3<br />
1/3 1/3 0 1/3<br />
1/3 1/3 1/3 0<br />
⎞<br />
⎟<br />
⎠<br />
18. (a)<br />
(2, 000, 000)p 12 +(2, 000, 000)p 22 +(2, 000, 000)p 32 =2, 107, 800<br />
(b) If “today” is 1994, then 16 years have passed<br />
(2, 000, 000)(p (16)<br />
11 + p (16)<br />
21 + p (16)<br />
31 ) ≈ 2, 019, 566<br />
19. (a) M = {0, 1, 2,...,k} is the number of prisoners that remain in the prison<br />
n is the number of months<br />
Let<br />
( i<br />
b(i, l) = p<br />
l)<br />
l (1 − p) i−l<br />
which is the probability l prisoners are paroled if there are i in prison.<br />
Then P has the following <strong>for</strong>m