Unformatted text preview: IOE 543 Winter 2010 Homework 7 Solution Problem 1 (a) (b) Problem 2 2 3 4 Problem 3 m Upper bound= n ∑∑ p
i =1 j =1 ij ⎧ ⎩ n
pij , max ∑ pij ⎬ ∑
n Lower bound= max ⎨ max
i Problem 4 M1: j6(c=9),j5(c=17), j3(c=23), j2(c=28), j4(c=34), j1(c=37) M2: j5(c=8),j3(c=14), j4(c=20), j6(c=29), j1(c=32), j2(c=37) M3: j4(c=6),j2(c=11), j6(c=20), j1(c=23), j3(c=29), j5(c=37) M4: j3(c=6),j4(c=12), j2(c=17), j5(c=25), j1(c=28), M4 idle (from 28‐29) j6(c=38) Cmax=38 This answer is purely based on trials. Solutions based on other algorithms which can give a Cmax ranging from 38 to 40 are all acceptable. Problem 5 (a) X ≥lr Y ⇔ p( x = t ) non‐decreasing in t=0,1,2… p( y = t ) No, x1, x2 are not likelihood ratio ordered. (b) X ≥ st Y ⇔ p ( x > t ) ≥ p ( y > t ) for all t Yes, X 1 ≥ st X 2 ...
View Full Document
This note was uploaded on 03/16/2012 for the course IEOR 466 taught by Professor Richard during the Spring '12 term at Columbia.
- Spring '12