Modified Solution For Neutrosophic Linear Programming Problems With Mixed Constraints PDF Download

Science is the basis for managing the affairs of life and human activities, and living without knowledge is a form of wandering and a kind of loss. Using scientific methods helps us understand the foundations of choice, decision-making, and adopting the right solutions when solutions abound and options are numerous. Operational research is considered the best that scientific development has provided because its methods depend on the application of scientific methods in solving complex issues and the optimal use of available resources in various fields, private and governmental work in peace and war, in politics and economics, in planning and implementation, and in various aspects of life. Its basic essence is to use the data provided for the issue under study to build a mathematical model that is the optimal solution. It is the basis on which decision makers rely in managing institutions and companies, and when operations research methods meet with the neutrosophic teacher, we get ideal solutions that take into account all the circumstances and fluctuations that may occur in the work environment over time. One of the most important operations research methods is the linear programming method. Which prompted us to reformulate the linear models, the graphical method, and the simplex method, which are used to obtain the optimal solution for linear models using the concepts of neutrosophic science. In this research, and as a continuation of what we presented previously, we will reformulate the modified simplex algorithm that was presented to address the difficulty that we were facing when applying the direct simplex algorithm. It is the large number of calculations required to be performed in each step of the solution, which requires a lot of time and effort.