A New Approach For Solving Neutrosophic Integer Programming Problems

Linear programming is one of the most important usages of operation research methods in real life, that includes of one objective function and one or several constraints which can be in the form of equality and inequality. Most of the problems in the real world are include of inconsistent and astute uncertainty, because of this reason we can’t obtain the optimal solution easily. In this paper, we introduce a new model for Neutrosophic Integer Programming Problems where the coefficient of problems are neutrosophic numbers and by using a new score function will propose a method for solving them.