Generation of some methods for solving interval multi-objective linear programming models

In this paper, we consider interval multi-objective linear programming (IMOLP) models which are very important due to deal with inaccurate data and uncertainties. The aim of this paper is to solve the IMOLP models and obtaining efficient solutions. We first extend Ecker-Kouada method in which the va...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Opsearch Ročník 58; číslo 4; s. 1077 - 1115
Hlavní autoři: Allahdadi, Mehdi, Batamiz, Aida
Médium: Journal Article
Jazyk:angličtina
Vydáno: New Delhi Springer India 01.12.2021
Springer Nature B.V
Témata:
Business and Management
Linear programming
Management
Mathematics
Multiple objective analysis
Operations research
Operations Research/Decision Theory
Theoretical Article
Ecker-Kouada
Interval multi-objective linear programming
Uncertainty
Efficient solution
Benson
ISSN:0030-3887, 0975-0320
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í:In this paper, we consider interval multi-objective linear programming (IMOLP) models which are very important due to deal with inaccurate data and uncertainties. The aim of this paper is to solve the IMOLP models and obtaining efficient solutions. We first extend Ecker-Kouada method in which the variables are interval, and we introduce interval version of the Ecker-Kouada method which is called I-Ecker-Kouada method. Also, we introduce interval version of Benson’s method (I-Benson) which is not a complicated method. Finally, numerical examples and comparison with other methods are employed to illustrate the advantages of our methods.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0030-3887
0975-0320
DOI:10.1007/s12597-021-00512-w