Authors: Ibrahim M. Hezam, Mohamed Abdel-Baset, 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.
Comments: 14 Pages.
Download: PDF
[v1] 2018-08-21 03:13:39
Unique-IP document downloads: 45 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.