Equivalent mathematical programming formulations of monotonic tree network location problems

We consider the optimization problem of locating several new facilities on a tree network, with respect to existing facilities, and to each other. The new facilities are not restricted to be at vertices of the network, but the locations are subject to constraints. The new facilities are to be located so as to minimize the objective function subject to upper bounds on the constraint functions. We show that such problems are equivalent to mathematical programming problems which, when each function is expressed using only maximization and summation operations on nonnegatively weighted arguments, are linear programming problems of polynomial dimensions.