.png){kind=icon}
.png){kind=icon}
Return
An epsilon-constraint method for fully fuzzy multiobjective linear programming
.png){kind=icon}
OA
AI
DOI：10.1002/int.22219.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Linear ranking functions are often used to transform fuzzy multiobjective linear programming (MOLP) problems into crisp ones. The crisp MOLP problems are then solved by using classical methods (eg, weighted sum, epsilon-constraint, etc), or fuzzy ones based on Bellman and Zadeh's decision-making model. In this paper, we show that this transformation does not guarantee Pareto optimal fuzzy solutions for the original fuzzy problems. By using lexicographic ranking (LR) criteria, we propose a fuzzy epsilon-constraint method that yields Pareto optimal fuzzy solutions of fuzzy variable and fully fuzzy MOLP problems, in which all parameters and decision variables take on LR fuzzy numbers. The proposed method is illustrated by means of three numerical examples, including a fully fuzzy multiobjective project crashing problem.
Keywords:
epsilon-constraint method
fully fuzzy multiobjective linear programming
lexicographic ranking criterion
LR fuzzy number
project crashing
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.7
Papers:
3.0K
Citations:
8.1K