Efficient Solutions in Multiobjective Tree Network Location Problems.
FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
Pagination or Media Count:
Much of the literature involving locating one or more new facilities on a network is concerned with minimizing a single objective function subject to constraints on the location variable. In this paper, 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. In addition, an example problem is provided. We also consider the case where the feasible region is not a convex set. Author
- Numerical Mathematics