We consider the coupon collection problem, where each coupon is one of the types 1,…,s with probabilities given by a vector 𝒑. For specified numbers r
, we are interested in finding 𝒑 that minimizes the expected time to obtain at least r
type-i coupons for all i=1,…,s. For example, for s=2, r
1=1, and r
2=r, we show that p
1=(logr−log(logr))∕r is close to optimal.