.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
MULTIPLE OBJECTIVE LINEAR PROGRAMMING
LEXICOGRAPHIC ORDER
NUCLEOLAR SOLUTION
ALGORITHM
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSave no more
no more