Neutrosophic Integer Programming Problem

Neutrosophic Sets and Systems 15:3-7 (2017)
  Copy   BIBTEX


In this paper, we introduce the integer programming in neutrosophic environment, by considering coffecients of problem as a triangulare neutrosophic numbers. The degrees of acceptance, indeterminacy and rejection of objectives are simultaneously considered. The Neutrosophic Integer Programming Problem (NIP) is transformed into a crisp programming model, using truth membership (T), indeterminacy membership (I), and falsity membership (F) functions as well as single valued triangular neutrosophic numbers. To measure the efficiency of the model, we solved several numerical examples.

Author's Profile

Florentin Smarandache
University of New Mexico


Added to PP

39 (#82,529)

6 months
24 (#75,483)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?