The Graphical Method For Finding The Optimal Solution For Neutrosophic Linear Models And Taking Advantage Of Non Negativity Constraints To Find The Optimal Solution For Some Neutrosophic Linear Models In Which The Number Of Unknowns Is More Than Three
Download The Graphical Method For Finding The Optimal Solution For Neutrosophic Linear Models And Taking Advantage Of Non Negativity Constraints To Find The Optimal Solution For Some Neutrosophic Linear Models In Which The Number Of Unknowns Is More Than Three PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get The Graphical Method For Finding The Optimal Solution For Neutrosophic Linear Models And Taking Advantage Of Non Negativity Constraints To Find The Optimal Solution For Some Neutrosophic Linear Models In Which The Number Of Unknowns Is More Than Three book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
The Graphical Method for Finding the Optimal Solution for Neutrosophic linear Models and Taking Advantage of Non-Negativity Constraints to Find the Optimal Solution for Some Neutrosophic linear Models in Which the Number of Unknowns is More than Three
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.
Neutrosophic linear models and algorithms to find their optimal solution
Author: Florentin Smarandache
language: en
Publisher: Infinite Study
Release Date: 2023-12-01
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.
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.