Journal article Open Access

Generalised single valued neutrosophic number and its application to neutrosophic linear programming

Tuhin Bera; Nirmal Kumar Mahapatra

In this paper, the concept of single valued neutrosophic number (SV N-number) is presented in a generalized
way. Using this notion, a crisp linear programming problem (LP-problem) is extended to a neutrosophic linear
programming problem (NLP-problem). The coefficients of the objective function of a crisp LP-problem are considered
as generalized single valued neutrosophic number (GSV N-number). This modified form of LP-problem is here
called an NLP-problem. An algorithm is developed to solve NLP-problem by simplex method. Finally, this simplex
algorithm is applied to a real life problem. The problem is illustrated and solved numerically.

Files (1.4 MB)
Name Size
1.4 MB Download
All versions This version
Views 5656
Downloads 2020
Data volume 28.2 MB28.2 MB
Unique views 5454
Unique downloads 1919


Cite as