Scholarlink

The present treatise aims to formulate a general fully fuzzy Multi Objective Linear Programming Problem (FFMOLPP) under Intuitionistic Fuzzy Environment (IFE) aiding Triangular Intuitionistic Fuzzy Numbers (TIFNs) to reflect decision maker’s (DMs’) choice. To solve the problem, firstly, the fuzzy parameters have been converted into crisp numbers using the accuracy function defined on TIFN. Secondly, a tolerance based approach has been proposed to convert the fuzzy inequality or equality constraints to crisp constraints. Thirdly, the membership functions corresponding to multiple objectives have been formulated based on optimistic and pessimistic values of the objective functions. Finally, using Bellman-Zadeh’s principle and Zimmermann’s operator, the crisp Linear Programming model has been solved. The proposed method has been illustrated with a numerical example. The proposed approach elicits an efficient solution.The reliability and authenticity of the results have been checked through comparative investigations. It has been observed that the proposed method arouses better objective values in comparison with existing techniques.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A Novel Approach to Solve Fully Fuzzy Multi Objective Linear Programming Problem

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Pallabi Pal,
  • Sayanta Chakraborty,
  • Apu Kumar Saha

摘要

The present treatise aims to formulate a general fully fuzzy Multi Objective Linear Programming Problem (FFMOLPP) under Intuitionistic Fuzzy Environment (IFE) aiding Triangular Intuitionistic Fuzzy Numbers (TIFNs) to reflect decision maker’s (DMs’) choice. To solve the problem, firstly, the fuzzy parameters have been converted into crisp numbers using the accuracy function defined on TIFN. Secondly, a tolerance based approach has been proposed to convert the fuzzy inequality or equality constraints to crisp constraints. Thirdly, the membership functions corresponding to multiple objectives have been formulated based on optimistic and pessimistic values of the objective functions. Finally, using Bellman-Zadeh’s principle and Zimmermann’s operator, the crisp Linear Programming model has been solved. The proposed method has been illustrated with a numerical example. The proposed approach elicits an efficient solution.The reliability and authenticity of the results have been checked through comparative investigations. It has been observed that the proposed method arouses better objective values in comparison with existing techniques.