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

Full description

Saved in:
Bibliographic Details
Published in:Opsearch Vol. 58; no. 4; pp. 1077 - 1115
Main Authors: Allahdadi, Mehdi, Batamiz, Aida
Format: Journal Article
Language:English
Published: New Delhi Springer India 01.12.2021
Springer Nature B.V
Subjects:
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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography: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