A class of two-stage plant location problems on a chain is considered. It is shown that the solution of the transportation problem corresponding to the original problem produces optimal flows. The solution of the original problem is reduced to the solution of one-stage location problems on a chain.
Translated from Kibernetika, No. 5, pp. 69–72, September–October, 1989.