Premium
Signed distance ranking based approach for solving bounded interval‐valued fuzzy numbers linear programming problems
Author(s) -
Ebrahimnejad Ali,
Verdegay Jose Luis,
Garg Harish
Publication year - 2019
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/int.22130
Subject(s) - mathematics , bounded function , linear programming , fuzzy number , interval (graph theory) , ranking (information retrieval) , mathematical optimization , simplex algorithm , fuzzy logic , fuzzy set , computer science , combinatorics , artificial intelligence , mathematical analysis
Fuzzy linear programming (FLP) problems with a wide varietyof applications in sciencesand engineering allow working with imprecise data and constraints, leading to more realistic models. The main contribution of this study is to deal with the formulation of a kind of FLP problems, known as bounded interval‐valued fuzzy numbers linear programming (BIVFNLP) problems, with coefficients of decision variables in the objective function, resource vector, and coefficients of the technological matrix represented as interval‐valued fuzzy numbers (IVFNs), and crisp decision variables limited to lower and upper bounds. Here, based on signed distance ranking to order IVFNs, the bounded simplex method is extended to obtain an interval‐valued fuzzy optimal value for the BIVFNLP problem under consideration. Finally, one illustrative example is given to show the superiority of the proposed algorithm over the existing ones.