SELECTING THE BEST OXE OF SEVERAL BINOMIAL POPULATIONS 553 



700 



60O 



500 



400 



300 



200 



100 



3 4 5 6 8 



10 



k 



20 30 40 50 60 80 100 



Fig. 9 — Number of units n required per process to guarantee a probability of 

 P* = 0.75 of selecting the best of k binomial processes when the true difference 

 P 111 ~ V [2) is at least d*. 



5 6 



8 10 



k 



20 



30 40 50 60 80 100 



Fig. 10 — Number of units n required per process to guarantee a probabilit}^ of 

 P* = 0.80 of selecting the best of k binomial processes when the true difference 

 Pin ~ P[2i is at least d*. 



