EFFICIENCY IN EUCLIDEAN CONSTRAINED LOCATION-PROBLEMS

被引:11
作者
CARRIZOSA, E
CONDE, E
FERNANDEZ, FR
PUERTO, J
机构
[1] Dpto. de Estadistica e Investigacion Operativa, Facultad de Matematicas, Universidad de Sevilla, 41012 Sevilla, Tarfia s/n
关键词
EFFICIENCY; LOCATION THEORY; WEBER PROBLEMS;
D O I
10.1016/0167-6377(93)90095-X
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:291 / 295
页数:5
相关论文
共 5 条
[1]  
BRONDSTED A., 1983, INTRO CONVEX POLYTOP, V90
[2]   PROPER EFFICIENCY AND THEORY OF VECTOR MAXIMIZATION [J].
GEOFFRION, AM .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1968, 22 (03) :618-+
[3]  
KUHN HW, 1969, NONLINEAR PROGRAMMIN
[4]   SOME PROPERTIES OF LOCATION-PROBLEMS WITH BLOCK AND ROUND NORMS [J].
THISSE, JF ;
WARD, JE ;
WENDELL, RE .
OPERATIONS RESEARCH, 1984, 32 (06) :1309-1327
[5]  
WITZGALL C, 1964, NBS8388 REP