.png){kind=icon}
返回
A Compromise Solution for the Fully Fuzzy Multiobjective Linear Programming Problems
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2018.2863566.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A new approach is undertaken to solve the fully fuzzy multiobjective linear programming (FFMLP) problem. The coefficients of the objective functions, constraints, right-hand-side parameters, and variables are of the triangular fuzzy number (TrFN)s. A solution strategy, called compromise solution algorithm (CSA), is presented using a three-step procedure. First, a revised simplex method together with Gaussian elimination in the environment of the linear ranking function is used to convert the FFMLP problems partially into semi fully fuzzy multiobjective linear programming (SFFMLP) problems. Then, the obtained SFFMLP problems are gathered together as a single problem. Finally, the gathered problem is solved by one of four different methods to find a fuzzy compromise solution for the FFMLP problems. The CSA is then numerically applied to a FFMLP problem to illustrate the practicability of the proposed procedure.
Keyword:
FFMLP problems
SFFMLP problems
FFLP problem
SFFLP problem
CSA
simplex method and Gaussian elimination
fuzzy simplex method
linear ranking function
and fuzzy compromise solution
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容