Generalised Single-Valued Neutrosophic Number and Its Application to Neutrosophic Linear Programming

In this chapter, the concept of single valued neutrosophic number (SVN-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 (GSVN-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.

Related Organizations

Panskura Banamali College
India

Keywords

Single valued neutrosophic number; Neutrosophic linear programming problem; Simplex method., Single valued neutrosophic number, Neutrosophic linear programming problem, Electronic computers. Computer science, QA1-939, QA75.5-76.95, Simplex method, Mathematics

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	3
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average