A dual-based algorithm for solving lexicographic multiple objective programs

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 worth...

Full description

Saved in:
Bibliographic Details
Published inEuropean journal of operational research Vol. 176; no. 3; pp. 1348 - 1356
Main Authors Pourkarimi, L., Zarepisheh, M.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.02.2007
Elsevier
Elsevier Sequoia S.A
SeriesEuropean Journal of Operational Research
Subjects
Algorithms
Applied sciences
Duality
Exact sciences and technology
Lexicographic
Linear programming
MOLP
Operational research. Management science
Problem solving
Studies
Theorems
Linear programming
MOLP
Duality
Lexicographic
Lexicography
Multiobjective programming
Objective function
Online AccessGet full text
ISSN0377-2217
1872-6860
DOI10.1016/j.ejor.2005.10.046

Cover

More Information
Summary: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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2005.10.046