Multi-objective linear programming with interval coefficients

Purpose - The purpose of this paper is to extend a methodology for solving multi-objective linear programming (MOLP) problems, when the objective functions and constraints coefficients are stated as interval numbers.Design methodology approach - The approach proposed in this paper for the considered...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Kybernetes Ročník 42; číslo 3; s. 482 - 496
Hlavní autoři: Hossein Razavi Hajiagha, Seyed, Amoozad Mahdiraji, Hannan, Sadat Hashemi, Shide
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Emerald Group Publishing Limited 22.03.2013
Témata:
ISSN:0368-492X, 1758-7883
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Purpose - The purpose of this paper is to extend a methodology for solving multi-objective linear programming (MOLP) problems, when the objective functions and constraints coefficients are stated as interval numbers.Design methodology approach - The approach proposed in this paper for the considered problem is based on the maximization of the sum of membership degrees which are defined for each objective of multi objective problem. These membership degrees are constructed based on the deviation from optimal solutions of individual objectives. Then, the final model based on membership degrees is itself an interval linear programming which can be solved by current methods.Findings - The efficiency of the solutions obtained by the proposed method is proved. It is shown that the obtained solution by the proposed method for an interval multi objective problem is Pareto optimal.Research limitations implications - The proposed method can be used in modeling and analyzing of uncertain systems which are modeled in the context of multi objective problems and in which required information is ill defined.Originality value - The paper proposed a novel and well-defined algorithm to solve the considered problem.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0368-492X
1758-7883
DOI:10.1108/03684921311323707