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

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

Nirmal Kumar Mahapatra (Panskura Banamali College (Autonomous), India) and Tuhin Bera (Panskura Banamali College (Autonomous), India)
Copyright: © 2020 |Pages: 35
DOI: 10.4018/978-1-7998-2555-5.ch009

Abstract

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.
Chapter Preview
Top

2 Preliminaries

Some basic definitions are provided to bring the main thought of this paper here.

Complete Chapter List

Search this Book:
Reset