Solving the general fully neutrosophic multi-level multiobjective linear programming problems

Khatter (Soft Computing 24 (2020) pointed out that although several approaches are proposed in the literature to solve single-valued neutrosophic linear programming problems (SVNLPPS) (linear programming problems in which all the parameters except decision variables are either represented by single-valued triangular neutrosophic numbers (SVTNNS) or single-valued trapezoidal neutrosophic numbers (SVTrNNS)). However, all the methods for comparing single-valued neutrosophic numbers (SVNNS), used in existing approaches, are independent from the attitude of the decision maker towards the risk. To fill this gap, Khatter (2020), firstly, proposed a method for comparing two SVNNS by considering the attitude of the decision maker towards the risk.Then, using the proposed comparing method, Khatter (2020) proposed an approach to solve SVNLPPS. In this paper, it is pointed out that a mathematical incorrect result is considered in Khatter's approach. Hence, it is inappropriate to use Khatter's approach. Also, it is pointed out that some mathematical incorrect results are considered in other existing approaches for solving SVNLPPS. Hence, it is inappropriate to use other existing approaches for solving SVNLPPS. Furthermore, to resolve the inappropriateness of Khatter's approach and other existing approaches, a new approach (named as Mehar approach) is proposed to solve SVNLPPS. Finally, correct optimal solution of some existing SVNLPPS is obtained by the proposed Mehar approach.

show abstract

An improved solution for fully neutrosophic multi-level linear programming problem based on Laplace transform

Lachhwani

2023

OPSEARCH

View full text Add to dashboard Cite

Solving the general fully neutrosophic multi-level multiobjective linear programming problems

Cited by 8 publications

References 30 publications

Simplified TOPSIS for MLN-MODM Problems

Simplified TOPSIS for MLN-MODM Problems

Mehar approach to solve neutrosophic linear programming problems using possibilistic mean

An improved solution for fully neutrosophic multi-level linear programming problem based on Laplace transform

Contact Info

Product

Resources

About