SINGLE-OBJECTIVE LINEAR GOAL PROGRAMMING PROBLEM WITH NEUTROSOPHIC NUMBERS

This paper deals with single-objective linear goal programming problem with neutrosophic numbers. The coefficients of objective function and the constraints are considered as neutrosophic numbers of the form (p + qI), where p, q are real numbers and I denotes indeterminacy. In the solution process, the neutrosophic numbers are transformed into interval numbers. Then, the problem reduces to single-objective linear interval programming problem. Employing interval programming technique, the target interval of the objective function is determined. For the sake of achieving the target goals, the goal achievement function is constructed.  Three new goal programming models are developed to solve the reduced problem. Two numerical examples are solved to illustrate the proposed method. The obtained results are also compared with the existing methods.