Neutrosophic Treatment Of Duality Linear Models And The Binary Simplex Algorithm

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.

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.

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.

Transport issues aim to determine the number of units that will be transferred from the production centers to consumption areas so that the cost of transportation is as low as possible, taking into account the conditions of supply and demand. Due to the great importance of these issues and to obtain more accurate results that take into account all circumstances, we conducted two research studies. In the first research, we presented a formulation of neutrosophic transport issues, and in the second research, we presented some ways to find a preliminary solution to these issues, but we do not know whether the preliminary solution is optimal or not, so we will present in this research a study whose purpose is to shed light on some important methods used to improve the optimal solution to transportation issues and then reformulating them using the concepts of neutrosophic science, a science that leaves nothing to chance or circumstances but rather provides solutions with neutrosophic values. Unspecified values take into account the best and worst conditions.

This paper develops a general form of neutrosophic linear fractional programming (NLFP) problem and proposed a novel model to solve it. In this method the NLFP problem is decomposed into two neutrosophic linear programming (NLP) problem. Furthermore, the problem has been solved by combination of dual simplex method and a special ranking function. In addition, the model is compared with an existing method. An illustrative example is shown for better understanding of the proposed method. The results show that the method is computationally very simple and comprehensible.

This monograph presents new developments in multi-level decision-making theory, technique and method in both modeling and solution issues. It especially presents how a decision support system can support managers in reaching a solution to a multi-level decision problem in practice. This monograph combines decision theories, methods, algorithms and applications effectively. It discusses in detail the models and solution algorithms of each issue of bi-level and tri-level decision-making, such as multi-leaders, multi-followers, multi-objectives, rule-set-based, and fuzzy parameters. Potential readers include organizational managers and practicing professionals, who can use the methods and software provided to solve their real decision problems; PhD students and researchers in the areas of bi-level and multi-level decision-making and decision support systems; students at an advanced undergraduate, master’s level in information systems, business administration, or the application of computer science.

Elementary Linear Programming with Applications presents a survey of the basic ideas in linear programming and related areas. It also provides students with some of the tools used in solving difficult problems which will prove useful in their professional career. The text is comprised of six chapters. The Prologue gives a brief survey of operations research and discusses the different steps in solving an operations research problem. Chapter 0 gives a quick review of the necessary linear algebra. Chapter 1 deals with the basic necessary geometric ideas in Rn. Chapter 2 introduces linear programming with examples of the problems to be considered, and presents the simplex method as an algorithm for solving linear programming problems. Chapter 3 covers further topics in linear programming, including duality theory and sensitivity analysis. Chapter 4 presents an introduction to integer programming. Chapter 5 covers a few of the more important topics in network flows. Students of business, engineering, computer science, and mathematics will find the book very useful.