Generalised single valued neutrosophic number and its application to neutrosophic linear programming
Keywords:Single valued neutrosophic number; Neutrosophic linear programming problem; Simplex method.
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 numericall
How to Cite
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
CC Attribution-NonCommercial-ShareAlike 4.0