Fuzzy sets have experienced multiple expansions since their conception to enhance their capacity to convey complex information. Intuitionistic fuzzy sets, image fuzzy sets, q-rung orthopair fuzzy sets, and neutrosophic sets are a few of these extensions. Researchers and academics have acquired a lot of information about their theories and methods for making decisions. However, only a small number of research findings discuss how neutrosophic sets theory and their extensions (NSTEs) are used in education. The Handbook of Research on the Applications of Neutrosophic Sets Theory and Their Extensions in Education implements fresh scientific approaches to enhance the quality of decisions under neutrosophic environments, particularly within education. Covering key topics such as data modeling, educational technologies, decision making, and learning management systems, this major reference work is ideal for instructional designers, researchers, academicians, scholars, practitioners, instructors, and students.
In this volume, we present a set of research that was published in cooperation with a number of researchers and those interested in keeping pace with the great scientific development that our contemporary world is witnessing, and one of its products was neutrosophic science, which was founded by the American scientist and mathematical philosopher Florentin Smarandache in 1995. Through it, we present a new vision for some research methods. Operations research to the concepts of this science.
Papers on neutrosophic and plithogenic sets, logics, probabilities and statistics, on NeutroAlgebra and AntiAlgebra, NeutroGeometry and AntiGeometry, SuperHyperAlgebra and Neutrosophic SuperHyperAlgebra, etc…
The science of operations research is one of the modern sciences that have made a great revolution in all areas of life through the methods provided by it, suitable and appropriate to solve most of the problems that were facing researchers, scholars and those interested in the development of societies, and the most beneficiaries of this science were companies and institutions that are looking for scientific methods that help them manage their work so that they achieve the greatest profit and the lowest cost, and one of the important methods that have been used in the management of companies we offer in this research two methods, Dynamic programming method. This method has been used in many practical matters and helped decision-makers in companies to achieve a maximum profit and less cost by formulating the reality of the state of the company and the data provided by decision-makers with a dynamic mathematical model that is solved using methods of solving dynamic models and we will provide in this research an example of this through the issue of choosing the optimal investment for the budget of a company so that it achieves a maximum profit, and the method of programming with integers: the method that provided these companies with solutions with integer values suitable for the nature of its work, through the use of the binary integer in the formulation of the appropriate mathematical model on the one hand, and on the other hand, the use of the binary integer variable helped to convert some nonlinear models that lead to some practical problems into linear models, and it should be noted here that in the previous two methods there is something indeterminable because we must make a decision in choosing or not choosing something, but the optimal solution that we will get remains A specific value because we are building the mathematical model for any realistic issue through the data provided by those responsible for the work and these data are calculated quantities and therefore they are uncertain values because their validity depends on the circumstances surrounding the work environment, they may be exposed to increase or decrease, and therefore the optimal solution on which the company will base its decision is suitable for specific values and any change in them can cause the company an uncalculated loss, so in this research we will use the concepts of neutrosophic science, the branch of science founded by the American scientist Florentin Smarandache in 1995 based on his belief that there is no absolute truth, a science that is interested in the study of ideas and concepts that are neither true nor false, but just in between, and we will take the data (calculated quantities) neutrosophic values that are specified or unspecified values are any set close to the calculated quantities, then the resulting mathematical model is a neutrosophic model and the optimal solution has neutrosophic values and thanks to the indefinite uncertainty that these values have, companies from the development of appropriate plans for all circumstances and thus achieve the greatest profit and the lowest cost, and we will clarify the above through two issues, the issue of optimal designation of a warehouse site, which we will formulate the mathematical model of using the neutrosophic integer programming method - and the issue of capital budget, which we will present in two different forms, we use in the first form the neutrosophic integer programming method and in the second the neutrosophic dynamic programming method.
Papers on neutrosophic and plithogenic sets, logics, probabilities and statistics, on NeutroAlgebra and AntiAlgebra, NeutroGeometry and AntiGeometry, SuperHyperAlgebra and Neutrosophic SuperHyperAlgebra, etc…
In this book, we present a study of linear models and algorithms to find the optimal solution for them using the concepts of neuroscientific science. We know that the linear programming method is one of the important methods of operations research, the science that was the product of the great scientific development that our contemporary world is witnessing. The name operations research is given to the group of scientific methods used. In analyzing problems and searching for optimal solutions, it is a science whose applications have achieved widespread success in various fields of life. What is meant by neutrosophic models are models in which the data are neutrosophic values, that is, variables such as in the objective function, which expresses profit if the model is a maximization model, and expresses a cost if the model is a minimization model, which in turn is affected by environmental conditions.
The linear programming method is one of the important methods of operations research that has been used to address many practical issues and provided optimal solutions for many institutions and companies, which helped decision makers make ideal decisions through which companies and institutions achieved maximum profit, but these solutions remain ideal and appropriate in If the conditions surrounding the work environment are stable, because any change in the data provided will affect the optimal solution and to avoid losses and achieve maximum profit, we have, in previous research, reformulated the linear models using the concepts of neutrosophic science, the science that takes into account the instability of conditions and fluctuations in the work environment and leaves nothing to chance. While taking data, neutrosophic values carry some indeterminacy, giving a margin of freedom to decision makers. In another research, we reformulated one of the most important methods used to solve linear models, which is the simplex method, using the concepts of this science, and as a continuation of what we did in the previous two researches, we will reformulate in this research. The graphical method for solving linear models using the concepts of neutrosophics. We will also shed light on a case that is rarely mentioned in most operations research references, which is that when the difference between the number of unknowns and the number of constraints is equal to one, two, or three, we can also find the optimal solution graphically for some linear models. This is done by taking advantage of the conditions of non-negativity that linear models have, and we will explain this through an example in which the difference is equal to two. Also, through examples, we will explain the difference between using classical values and neutrosophic values and the extent of this’s impact on the optimal solution.
The need for tailored data for machine learning models is often unsatisfied, as it is considered too much of a risk in the real-world context. Synthetic data, an algorithmically birthed counterpart to operational data, is the linchpin for overcoming constraints associated with sensitive or regulated information. In high-dimensional data, where the dimensions of features and variables often surpass the number of available observations, the emergence of synthetic data heralds a transformation. Applications of Synthetic High Dimensional Data delves into the algorithms and applications underpinning the creation of synthetic data, which surpass the capabilities of authentic datasets in many cases. Beyond mere mimicry, synthetic data takes center stage in prioritizing the mathematical domain, becoming the crucible for training robust machine learning models. It serves not only as a simulation but also as a theoretical entity, permitting the consideration of unforeseen variables and facilitating fundamental problem-solving. This book navigates the multifaceted advantages of synthetic data, illuminating its role in protecting the privacy and confidentiality of authentic data. It also underscores the controlled generation of synthetic data as a mechanism to safeguard private information while maintaining a controlled resemblance to real-world datasets. This controlled generation ensures the preservation of privacy and facilitates learning across datasets, which is crucial when dealing with incomplete, scarce, or biased data. Ideal for researchers, professors, practitioners, faculty members, students, and online readers, this book transcends theoretical discourse.
One of the most important theories in linear programming is the dualistic theory and its basic idea is that for every linear model has dual linear model, so that solving the original linear model gives a solution to the dual model. Therefore, when we solving the linear programming model, we actually obtain solutions for two linear models. In this research, we present a study of the models. The neutrosophic dual and the binary simplex algorithm, which works to find the optimal solution for the original and dual models at the same time. The importance of this algorithm is evident in that it is relied upon in several operations research topics, such as integer programming algorithms, some nonlinear programming algorithms, and sensitivity analysis in linear programming.
