A Direct Model for Triangular Neutrosophic Linear Programming

Abstract

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.