The aims of the paper are to present a modified symmetric fuzzy approach to find the best workable compromise solution for quadratic fractional programming problems (QFPP) with fuzzy crisp in both the objective functions and the constraints. We introduced a modified symmetric fuzzy by proposing a procedure, that starts first by converting the quadratic fractional programming problems that exist in the objective functions to crisp numbers and then converts the linear function that exists in the constraints to crisp numbers. After that, we applied the fuzzy approach to determine the optimal solution for our quadratic fractional programming problem which is supported theoretically and practically. The computer application for the algorithm was tested, and finally compared modified symmetric fuzzy approach with the modified simplex approach which is shown in the table 1. Finally, the procedures of numeric results in the paper indicate that modified symmetric fuzzy approach is reliable and saves valuable time.
In this effort, we define a new class of fractional analytic functions containing functional parameters in the open unit disk. By employing this class, we introduce two types of fractional operators, differential and integral. The fractional differential operator is considered to be in the sense of Ruscheweyh differential operator, while the fractional integral operator is in the sense of Noor integral. The boundedness and compactness in a complex Banach space are discussed. Other studies are illustrated in the sequel.
An approximate solution of the liner system of ntegral cquations fot both fredholm(SFIEs)and Volterra(SIES)types has been derived using taylor series expansion.The solusion is essentailly
In this paper we generalize Jacobsons results by proving that any integer in is a square-free integer), belong to . All units of are generated by the fundamental unit having the forms
Our generalization build on using the conditions
This leads us to classify the real quadratic fields into the sets Jacobsons results shows that and Sliwa confirm that and are the only real quadratic fields in .
Let G be a graph, each edge e of which is given a weight w(e). The shortest path problem is a path of minimum weight connecting two specified vertices a and b, and from it we have a pre-topology. Furthermore, we study the restriction and separators in pre-topology generated by the shortest path problems. Finally, we study the rate of liaison in pre-topology between two subgraphs. It is formally shown that the new distance measure is a metric
In this work, we are concerned with how to find an explicit approximate solution (AS) for the telegraph equation of space-fractional order (TESFO) using Sumudu transform method (STM). In this method, the space-fractional order derivatives are defined in the Caputo idea. The Sumudu method (SM) is established to be reliable and accurate. Three examples are discussed to check the applicability and the simplicity of this method. Finally, the Numerical results are tabulated and displayed graphically whenever possible to make comparisons between the AS and exact solution (ES).
This article deals with the approximate algorithm for two dimensional multi-space fractional bioheat equations (M-SFBHE). The application of the collection method will be expanding for presenting a numerical technique for solving M-SFBHE based on “shifted Jacobi-Gauss-Labatto polynomials” (SJ-GL-Ps) in the matrix form. The Caputo formula has been utilized to approximate the fractional derivative and to demonstrate its usefulness and accuracy, the proposed methodology was applied in two examples. The numerical results revealed that the used approach is very effective and gives high accuracy and good convergence.
The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.
The aim of this paper is to introduce the definition of a general fuzzy norned space as a generalization of the notion fuzzy normed space after that some illustrative examples are given then basic properties of this space are investigated and proved.
For example when V and U are two general fuzzy normed spaces then the operator is a general fuzzy continuous at u V if and only if u in V implies S(u) in U.
Let R be a 2-torision free prime ring and ?, ?? Aut(R). Furthermore, G: R×R?R is a symmetric generalized (?, ?)-Biderivation associated with a nonzero (?, ?)-Biderivation D. In this paper some certain identities are presented satisfying by the traces of G and D on an ideal of R which forces R to be commutative