.png){kind=icon}
.png){kind=icon}
Return
Simplex Algorithm for Hesitant Fuzzy Linear Programming Problem with Hesitant Decision Variables and Right-hand-side Values
.png){kind=icon}
PRE
AI
DOI：10.1007/s40815-024-01790-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In order to make the best decisions in real-world applications, we must deal with optimization and decision-making problems that call for the input of experts and masters. Using an optimization problem with hesitant fuzzy parameters is important in these circumstances. Few studies have been done on the problem of hesitant fuzzy linear programming (HFLP). Therefore, in this article we study HFLP problems with hesitant decision variables and right-hand-side values. In order to solve the mentioned optimization problems, we suggest the hesitant fuzzy simplex algorithm. For this, first state the optimization theorems then express the hesitant fuzzy simplex algorithm using the introduced linear ranking functions. We will finally test the implementation of the suggested strategy by solving two descriptive examples using hesitant fuzzy information.
Keywords:
Hesitant fuzzy simplex algorithm
Hesitant fuzzy linear programming
Hesitant fuzzy ranking function
Hesitant fuzzy numbers
Journal
IF:
3.6
Papers:
2.2K
Citations:
4.3K