Optimal Neutrosophic Assignment and the Hungarian Method

Authors

  • Maissam jdid
  • Florentin Smarandache

Abstract

Operations research methods focus on formulating decision models, models that approximate the
real work environment to mathematical models, and their optimal solution helps the decision
maker to make optimal decisions that guarantee the greatest profit or the lowest cost. These models
were built based on the data collected on the practical issue under study, and these data are classic
values, specific values that are correct and accurate during the period in which these data are
collected, which means that they remain ideal if the surrounding conditions remain the same as
those in which they were collected. Data, and since the aim of this study is to make ideal decisions
and to develop future plans through which we achieve the greatest profit or the least cost, It was
necessary to search for a study that fits all the conditions in which the work environment passes in
the present and the future. If we take data, neural values, indeterminate values - uncertain - leave
nothing to chance, and take into account all conditions from worst to best. In this paper, we will
present a complementary study to what we have done in previous research, the purpose of which
was to reformulate some operational research methods using neutrosophic data. We will
reformulate the assignment problem and one of the methods for its solution, which is the Hungarian
method, using neutrosophic concepts, and we will explain the difference between using classical
and neutrosophic data through examples.

Downloads

Download data is not yet available.

Downloads

Published

2023-12-11

Issue

Section

SI#1,2024: Neutrosophical Advancements And Their Impact on Research

How to Cite

Maissam jdid, & Florentin Smarandache. (2023). Optimal Neutrosophic Assignment and the Hungarian Method. Neutrosophic Sets and Systems, 57, 210-223. http://fs.unm.edu/nss8/index.php/111/article/view/3513

Most read articles by the same author(s)

1 2 3 4 5 6 7 8 > >>