Fully Fuzzy Linear Programming Resolution Through Ranking Function Methodology
DOI:
https://doi.org/10.64252/sam7ac85Keywords:
Linear Programming with Fuzzy Constraints, Triangular, Fuzzy Number Coefficients, Fully Fuzzy Optimization, Fuzzy Simplex AlgorithmAbstract
This study introduces a novel and efficient approach for solving Fully Fuzzy Linear Programming Problems (FFLPP) by leveraging Triangular Fuzzy Numbers (TFN). The proposed method simplifies FFLPP by converting it into an equivalent Crisp Linear Programming Problem (LPP) through a systematic defuzzification process. This transformation ensures computational efficiency while maintaining solution accuracy. Comparative evaluations against existing techniques highlight the advantages of the proposed methodology. Numerical examples are included to validate the approach and demonstrate its effectiveness in practical applications.