Efficiency in Euclidean constrained location problems
In this note we 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 o...
| Authors: | , , , |
|---|---|
| Format: | article |
| Status: | Published version |
| Publication Date: | 1993 |
| Country: | España |
| Institution: | Universidad de Sevilla (US) |
| Repository: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/107629 |
| Online Access: | https://hdl.handle.net/11441/107629 https://doi.org/10.1016/0167-6377(93)90095-X |
| Access Level: | Open access |
| Keyword: | efficiency location theory Weber problems |
| Summary: | In this note we 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 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. |
|---|