Graphical Method For Solving Neutrosophical Nonlinear Programming Models
Download Graphical Method For Solving Neutrosophical Nonlinear Programming Models PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Graphical Method For Solving Neutrosophical Nonlinear Programming Models 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.
Graphical Method for Solving Neutrosophical Nonlinear Programming Models
An important method for finding the optimal solution for linear and nonlinear models is the graphical method, which is used if the linear or nonlinear mathematical model contains one, two, or three variables. The models that contain only two variables are among the most models for which the optimal solution has been obtained graphically, whether these models are linear or non-linear in references and research that are concerned with the science of operations research, when the data of the issue under study is classical data. In this research, we will present a study through, which we present the graphical method for solving Neutrosophical nonlinear models in the following case: A nonlinear programming issue, the objective function is a nonlinear function, and the constraints are linear functions. Note that we can use the same method if (i) the objective function follower is a linear follower and the constraints are nonlinear; (ii) the objective function is a non-linear follower and the constraints are non-linear. In the three cases, the nonlinear models are neutrosophic, and as we know, the mathematical model is a nonlinear model if any of the components of the objective function or the constraints are nonlinear expressions, and the nonlinear expressions may be in both. At the left end of the constraints are neutrosophic values, at least one or all of them. Then, the possible solutions to the neutrosophic nonlinear programming problem are the set of rays 𝑁𝑋 ∈ 𝑅𝑛that fulfills all the constraints. As for the region of possible solutions, it is the region that contains all the rays that fulfill the constraints. The optimal solution is the beam that fulfills all constraints and at which the function reaches a maximum or minimum value, depending on the nature of the issue under study (noting that it is not necessary to be alone).
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 Systems with Applications (NSWA), Vol. 9, 2023
Author: Florentin Smarandache
language: en
Publisher: Infinite Study
Release Date: 2023-09-23
Papers on neutrosophic and plithogenic sets, logics, probabilities and statistics, on NeutroAlgebra and AntiAlgebra, NeutroGeometry and AntiGeometry, SuperHyperAlgebra and Neutrosophic SuperHyperAlgebra, etc…