This paper studies procedures for bottleneck detection in closed queueing networks(CQN's) with multiple job classes. Bottlenecks refer to servers operating at utilization. For CQN's, this can occur as the population sizes approach infinity. Bottleneck detection reduces to a non-linear complementary problem which in important special cases may be interpreted as a Kuhn-Tucker set. Efficient computational procedures are provided.