Neutrosophic Assignment Problem via BnB Algorithm

摘要

This paper attempts to commence branch and bound technique to unravel the triangular fuzzy neutrosophic assignment problem (TFNAP). So far there are many researches based on fuzzy and intuitionistic fuzzy assignment problems; this is the first paper to deal with TFNAP which have been introduced as a simplification of crisp sets and intuitionistic fuzzy sets to indicate vague, imperfect, unsure, and incoherent notification about the existent world problem. Here a real-life agricultural problem where the farmer's objective is to locate the optimal assignment of paddocks to crops in such comportment that the total fertilizer cost becomes least is worked out to illustrate the efficiency of the branch and bound (BnB) algorithm in neutroshopic approach.