Efficient Solutions in Multiobjective Tree Network Location Problems

Abstract

Much of the literature involving the location of one or more new facilities on a network is concerned with minimizing a single objective function subject to constraints on the location variable. Here, we consider the problem of locating a single facility on a tree network where there is more than one objective function to be minimized. A constructive method is given for finding the efficient set of solutions when the objective functions are convex and the constraints define a convex set. Partial results are given for the case where the feasible region is not a convex set.