.png){kind=icon}
.png){kind=icon}
Return
A dual-based algorithm for solving lexicographic multiple objective programs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2005.10.046.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose an algorithm for solving lexicographic multiple objective programs based upon duality theorem. In the existing algorithm, we should solve several linear programming problems (LPPs); therefore if, in particular, there are several objective functions, this method is not worthwhile from the viewpoint of computation. But in our new algorithm we just solve one LPP. (c) 2006 Elsevier B.V. All rights reserved.
Keywords:
duality
lexicographic
MOLP
linear programming
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available