On the basis of the combination of single-valued neutrosophic sets and hesitant fuzzy sets, this article proposes a single-valued neutrosophic hesitant fuzzy set (SVNHFS) as a further generalization of the concepts of fuzzy set, intuitionistic fuzzy set, single-valued neutrosophic set, hesitant fuzzy set, and dual hesitant fuzzy set. Then, we introduce the basic operational relations and cosine...

The minimum cost network flow problem, (MCNFP) constitutes a wide category of network flow problems. Recently a new dual network exterior point simplex algorithm (DNEPSA) for the MCNFP has been developed. This algorithm belongs to a special “exterior point simplex type” category. Similar to the classical dual network simplex algorithm (DNSA), this algorithm starts with a dual feasible tree-solu...

nowadays, by the expansion of information technology in human life and dependence of business upon it, data protection, as one the most valuable and critical assets of the organization, has become the vital tool of modern industry and prerequisite for sustaining business process. in order to face the challenges and to take advantage of new opportunities brought forth by it advances we suggest o...

Fuzzy logic and fuzzy set theory provide an important framework for representing and managing imprecision and uncertainty in medical expert systems, but the need remains to optimize such systems to enhance performance. This paper presents a general technique for optimizing fuzzy models in fuzzy expert systems (FES’s) by simulated annealing (SA) and N -dimensional hill climbing simplex method. T...

As a natural extension of the dual simplex algorithm, the dual face algorithm performed remarkably in computational experiments with a set of Netlib standard problems. In this paper, we generalize it to bounded-variable LP problems via local duality.

In this note first we define the notions of intuitionistic fuzzy dual positive implicative hyper K-ideals of types 1,2,3,4 and intuitionistic fuzzy dual hyper K-ideals. Then we give some classifications about these notions according to the level subsets. Also by given some examples we show that these notions are not equivalent, however we prove some theorems which show that there are some relat...

One of the obstacles in a branch-and-cut IP-solving scheme is closing the gap between a known feasible solution and the solution(s) to LP relaxations of the problem. There are, however, a number of real-world problems, where, once an optimal solution is found, its optimality can easily be proved using neither branch-and-bound nor branch-and-cut methods. All one needs to do is find an integral s...