A linear programming problem in separable closed queueing networks

A separable closed queueing network is decomposed in two subnetworks, ℝA and ℝB. The rates of the servers in ℝB are controllable in order to maximize the throughput of ℝA. This problem of optimal flow control is transformed to a linear programming problem. The optimal solution of the linear program yields the structure of the optimal control. Conditions for the network are given to guarantee the applicability of this approach.