.png){kind=icon}
返回
Efficiency in constrained continuous location
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(97)00184-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a geometrical characterization of the efficient, weakly efficient and strictly efficient points for multiobjective location problems in presence of convex constraints and when distances are measured by an arbitrary norm. These results, established for a compact set of demand paints, generalize similar characterizations previously obtained for uncontrained problems, They are used to show that, in planar problems, the set of constrained weakly efficient points always coincides with the closest projection of the set of unconstrained weakly efficient points onto the feasible set. This projection property which an known previously only for strictly convex norms, allows to easily construct all the weakly efficient points and provides a useful localization property for efficient and strictly efficient points. (C) 1998 Elsevier Science B.V.
Keyword:
continuous location
efficiency with constraints
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏分享收藏
查看更多内容