A Novel Method for Solving Multiobjective Linear Programming Problems with Triangular Neutrosophic Numbers

In the field of operation research, linear programming (LP) is the most utilized apparatus for genuine application in various scales. In our genuine circumstances, the manager/decision-makers (DM) face problems to get the optimal solutions and it even sometimes becomes impossible. To overcome these limitations, neutrosophic set theory is presented, which can handle all types of decision, that is, concur, not certain, and differ, which is common in real-world situations. By thinking about these conditions, in this work, we introduced a method for solving neutrosophic multiobjective LP (NMOLP) problems having triangular neutrosophic numbers. In the literature study, there is no method for solving NMOLP problem. Therefore, here we consider a NMOLP problem with mixed constraints, where the parameters are assumed to be triangular neutrosophic numbers (TNNs). So, we propose a method for solving NMOLP problem with the help of linear membership function. After utilizing membership function, the problem is converted into equivalent crisp LP (CrLP) problem and solved by any suitable method which is readily available. To demonstrate the efficiency and accuracy of the proposed method, we consider one classical MOLP problem and solve it. Finally, we conclude that the proposed approach also helps decision-makers to not only know and optimize the most likely situation but also realize the outcomes in the optimistic and pessimistic business situations, so that decision-makers can prepare and take necessary actions for future uncertainty.