From ranking fuzzy numbers to solving fuzzy linear programming: a comprehensive review (Q2221556)

From MaRDI portal
Revision as of 11:06, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
From ranking fuzzy numbers to solving fuzzy linear programming: a comprehensive review
scientific article

    Statements

    From ranking fuzzy numbers to solving fuzzy linear programming: a comprehensive review (English)
    0 references
    0 references
    2 February 2021
    0 references
    Summary: Solving fuzzy linear programming (FLP) requires the employment of a consistent ranking of fuzzy numbers. Ineffective fuzzy number ranking would lead to a flawed and erroneous solving approach. This paper presents a comprehensive and extensive review on fuzzy number ranking methods. Ranking techniques are categorised into six classes based on their characteristics. They include centroid methods, distance methods, area methods, lexicographical methods, methods based on decision maker's viewpoint, and methods based on left and right spreads. A survey on solving approaches to FLP is also reported. We then point out errors in several existing methods that are relevant to the ranking of fuzzy numbers and thence suggest an effective method to solve FLP. Consequently, FLP problems are converted into non-fuzzy single (or multiple) objective linear programming based on a consistent centroid-based ranking of fuzzy numbers. Solutions of FLP are then obtained by solving corresponding crisp single (or multiple) objective programming problems by conventional methods.
    0 references
    review
    0 references
    ranking fuzzy numbers
    0 references
    fuzzy linear programming
    0 references
    FLP
    0 references
    fuzzy multiobjective linear programming
    0 references
    FMOLP
    0 references
    fuzzy number centroid
    0 references
    0 references
    0 references
    0 references

    Identifiers