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.

Operations on Single-Valued Trapezoidal Neutrosophic Numbers using (α,β,γ)-Cuts “Maple Package”

In this paper, we present a Maple package called Neutrosophic, which allows users to do operations on trapezoidal and triangular neutrosophic numbers including summation, subtraction, division, and multiplication based on -cuts and plots the results, also the package allows users to rank numbers depending on ambiguity index and value index. This package is very useful in neutrosophic decision-making problems, neutrosophic probabilities, neutrosophic statistics, and in many other fields of neutrosophic researches.

Triangular Neutrosophic-based EOQ model for non-Instantaneous Deteriorating Item under Shortages

In this paper, we applied the concept of triangular Neutrosophic number from a special viewpoint. Additionally, we utilized specific varieties of linear triangular Neutrosophic numbers and de-neutrosofication idea which could be very critical for uncertainty concept. Here, an EOQ model has been developed for a linearly dependent demand of non-instantaneous items under shortages. The paper considers holding cost as triangular neutrosophic number (TNN) and optimizes the model. A comparative study is done under crisps and neutrosophic domain and the model gives better result under the later domain. This noble notion will assist us to resolve a plethora of realistic existence problems in neutrosophic area.

Finding the Shortest Path With Neutrosophic Theory

In this chapter, the authors study a kind of network where the edge weights are characterized by single-valued triangular neutrosophic numbers. First, rigorous definitions of nodes, edges, paths, and cycles of such a network were proposed, which are then defined in algebraic terms. Then, characterization on the length of paths in such a network were presented. This is followed by the presentation of an algorithm for finding the shortest path length between two given nodes on the network. The proposed algorithm gives the shortest path length from source node to destination node based on a ranking method that takes both the length of edges and the number of nodes into account. Finally, a numerical example based on a real-life scenario is also presented to illustrate the efficiency and usefulness of the proposed approach.

A Direct Model for Triangular Neutrosophic Linear Programming

This paper aims to propose a new direct algorithm to solve the neutrosophic linear programming where the variables and right-hand side represented with triangular neutrosophic numbers. The effectiveness of the proposed procedure is illustrated through numerical experiments. The extracted results show that the new algorithm is straightforward and could be useful to guide the modeling and design of a wide range of neutrosophic optimization.

Cryptography in Terms of Triangular Neutrosophic Numbers with Real Life Applications

In this article, our main focus is to put forward the concept of Cryptography in terms of triangular neutrosophic numbers. This kind of cryptography is really reliable, manual, secure, and based on few simple steps. All the encryption and decryption are easy to proceed (mention below). As we know, Public-key cryptography as an indefatigable defender for human privacy and use as information transfer from the ages. various concepts are available with regard to cryptography e.g. Elliptic curve cryptography. TNNC (Triangular neutrosophic numbers cryptography) is familiar with basic concepts of math as well as applicable in different situations e.g. code cryptography, detailed view cryptography, and Graph cryptography encryption facilitate.

A new ranking function of triangular neutrosophic number and its application in integer programming

Real humankind problems have different sorts of ambiguity in the creation, and amidst them, one of the significant issues in solving the integer linear programming issues. In this commitment, the conception of aggregation of ranking function has been focused on a distinct framework of reference. Here, we build up another framework for neutrosophic integer programming issues having triangular neutrosophic numbers by using the aggregate ranking function. To legitimize the proposed technique, scarcely numerical analyses are given to show the viability of the new model. At long last, conclusions are talked about.