Journal article Open Access

Neutrosophic Goal Programming

Ibrahim M. Hezam; Mohamed Abdel-Basset; FLORENTIN SMARANDACHE

In this chapter, the goal programming in neutrosophic environment is introduced. The degree of acceptance, indeterminacy and rejection of objectives is considered simultaneous. In the two proposed models to solve Neutrosophic Goal Programming Problem (NGPP), our goal is to minimize the sum of the deviation in the model (I), while in the model (II), the neutrosophic goal programming problem NGPP is transformed into the crisp programming model using truth membership, indeterminacy membership, and falsity membership functions. Finally, the industrial design problem is given to illustrate the efficiency of the proposed models. The obtained results of Model
(I) and Model (II) are compared with other methods.

Files (974.3 kB)
Name Size
974.3 kB Download
All versions This version
Views 44
Downloads 66
Data volume 5.8 MB5.8 MB
Unique views 44
Unique downloads 55


Cite as