Efficiency in Euclidean constrained location problems

Efficiency in Euclidean constrained location problems

0.00 Avg rating0 Votes
Article ID: iaor1995454
Country: Netherlands
Volume: 14
Issue: 5
Start Page Number: 291
End Page Number: 295
Publication Date: Dec 1993
Journal: Operations Research Letters
Authors: , , ,
Keywords: optimization
Abstract:

In this note the authors present geometrical characterizations for the set of efficient, weakly efficient and properly efficient solutions to the multiobjective Euclidean Location problem with convex locational constraints, extending the known results for the unconstrained problem. It is shown that the set of the (weakly) efficient points coincides with the closest-point projection of the convex hull of the demand points onto the feasible set S. It is also shown that the set of properly efficient solutions is the union of the two sets: the set of feasible demand points and the closest-point projection of the relative interior of the convex hull of the demand points onto S.

Reviews

Required fields are marked *. Your email address will not be published.