.png){kind=icon}
.png){kind=icon}
Return
Obtaining Efficient Solutions of Interval Multi-objective Linear Programming Problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s40815-020-00800-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we consider interval multi-objective linear programming (IMOLP) models which are used to deal with uncertainties of real-world problems. So far, a variety of approaches for obtaining efficient solutions (ESs) of these problems have been developed. In this paper, we propose a new and two generalized methods. In the new method, converting IMOLP into an interval linear programming (ILP) and then obtaining its optimal solutions (OSs), ESs of the IMOLP are determined. This method has several advantages: (i) This method is the only method which obtains a solution box for IMOLP models. (ii) The solving process is not time consuming. (iii) The number of ESs is higher than for other methods. (V) The method is applicable for large-scale problems. Also, we generalize the epsilon-constraint and lexicographic methods which are used for obtaining ESs of the multi-objective linear programming (MOLP) models which do not have any problems such as lengthy and time-consuming and are applicable for large-scale problems. Some examples were solved to show the efficiency of the proposed methods. Finally, by the proposed method, we solve the IMOLP model corresponding to the problem of the facilities and non-return funds in a bank.
Keywords:
Efficient solution
Interval multi-objective linear programming
Uncertainty
epsilon-constraint
Lexicographic
Weighted sum
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
2.2K
Citations:
4.3K