Consider a P-hub location problem in which each of the nonhub nodes is connected to every hub. Such a network configuration would allow at most one stop service between every pair of cities. The hub...

Consider a P-hub location problem in which each of the nonhub nodes is connected to every hub. Such a network configuration would allow at most one stop service between every pair of cities. The hub through which service would be delivered for any origin/destination pair would be the hub which provides the least cost (or best) service. [Sasaki and Drezner (1994) outlined such a hub-and-spoke model, though they did not formulate it as a P-median problem as suggested below.]

(a) Show that this problem can be formulated as a variant of a P-median problem.

(b) What are the “demand” nodes in the P-median problem?