.png){kind=icon}
返回
LEXICOGRAPHIC OPTIMALITY IN THE MULTIPLE OBJECTIVE LINEAR-PROGRAMMING - THE NUCLEOLAR SOLUTION
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(92)90347-C.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we study the problem of multiple objective linear programming (MOLP). We introduce a new solution concept which is related to that of the nucleolus of n-person cooperative game theory. We prove that a general MOLP problem always has a solution in the new sense. The points in the nucleolus are efficient in the classic way. We prove existence and at the same time we introduce a constructing algorithm for computing it.
Keyword:
MULTIPLE OBJECTIVE LINEAR PROGRAMMING
LEXICOGRAPHIC ORDER
NUCLEOLAR SOLUTION
ALGORITHM
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
分享收藏 没有更多内容
没有更多内容