| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 479267 | European Journal of Operational Research | 2007 | 9 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
L. Pourkarimi, M. Zarepisheh,