In many applications such as production, planning, the decision maker is important in optimizing an objective function that has fuzzy ratio two functions which can be handed using fuzzy fractional programming problem technique. A special class of optimization technique named fuzzy fractional programming problem is considered in this work when the coefficients of objective function are fuzzy. New ranking function is proposed and used to convert the data of the fuzzy fractional programming problem from fuzzy number to crisp number so that the shortcoming when treating the original fuzzy problem can be avoided. Here a novel ranking function approach of ordinary fuzzy numbers is adopted for ranking of triangular fuzzy numbers with simpler and easier calculations as well as shortening in the procedures. The fuzzy fractional programming problem is the first reduced to a fractional programming problem and then solved with the technique to obtain the optimal solution. It has a power to give a best solution for supporting the solution theory proposed in this work, some numerical fuzzy fractional programming problem are included to ensure the advantage, efficiency and accuracy of the suggested algorithm. In addition, this research paper describes a comparison between our optimal solutions with other existing solutions for inequalities constrains fuzzy fractional program.
This paper is concerned with introducing and studying the first new approximation operators using mixed degree system and second new approximation operators using mixed degree system which are the core concept in this paper. In addition, the approximations of graphs using the operators first lower and first upper are accurate then the approximations obtained by using the operators second lower and second upper sincefirst accuracy less then second accuracy. For this reason, we study in detail the properties of second lower and second upper in this paper. Furthermore, we summarize the results for the properties of approximation operators second lower and second upper when the graph G is arbitrary, serial 1, serial 2, reflexive, symmetric, tra
... Show MoreThis paper deal with the estimation of the shape parameter (a) of Generalized Exponential (GE) distribution when the scale parameter (l) is known via preliminary test single stage shrinkage estimator (SSSE) when a prior knowledge (a0) a vailable about the shape parameter as initial value due past experiences as well as suitable region (R) for testing this prior knowledge.
The Expression for the Bias, Mean squared error [MSE] and Relative Efficiency [R.Eff(×)] for the proposed estimator are derived. Numerical results about beha
... Show MoreThe aim of the research is to examine the multiple intelligence test item selection based on Howard Gardner's MI model using the Generalized Partial Estimation Form, generalized intelligence. The researcher adopted the scale of multiple intelligences by Kardner, it consists of (102) items with eight sub-scales. The sample consisted of (550) students from Baghdad universities, Technology University, al-Mustansiriyah university, and Iraqi University for the academic year (2019/2020). It was verified assumptions theory response to a single (one-dimensional, local autonomy, the curve of individual characteristics, speed factor and application), and analysis of the data according to specimen partial appreciation of the generalized, and limits
... Show MoreIn this paper, author’s study sub diffusion bio heat transfer model and developed explicit finite difference scheme for time fractional sub diffusion bio heat transfer equation by using caputo fabrizio fractional derivative. Also discussed conditional stability and convergence of developed scheme. Furthermore numerical solution of time fractional sub diffusion bio heat transfer equation is obtained and it is represented graphically by Python.
In this paper, a new type of supra closed sets is introduced which we called supra β*-closed sets in a supra topological space. A new set of separation axioms is defined, and its many properties are examined. The relationships between supra β*-Ti –spaces (i = 0, 1, 2) are studied and shown with instances. Additionally, new varieties of supra β*-continuous maps have been taken into consideration based on the supra β*-open sets theory.
We introduce some new generalizations of some definitions which are, supra closure converge to a point, supra closure directed toward a set, almost supra converges to a set, almost supra cluster point, a set supra H-closed relative, supra closure continuous functions, supra weakly continuous functions, supra compact functions, supra rigid a set, almost supra closed functions and supra perfect functions. And we state and prove several results concerning it
Essential approaches involving photons are among the most common uses of parallel optical computation due to their recent invention, ease of production, and low cost. As a result, most researchers have concentrated their efforts on it. The Basic Arithmetic Unit BAU is built using a three-step approach that uses optical gates with three states to configure the circuitry for addition, subtraction, and multiplication. This is a new optical computing method based on the usage of a radix of (2): a binary number with a signed-digit (BSD) system that includes the numbers -1, 0, and 1. Light with horizontal polarization (LHP) (↔), light with no intensity (LNI) (⥀), and light with vertical polarization (LVP) (↨) is represen
... Show MoreWe introduce and discuss recent type of fibrewise topological spaces, namely fibrewise soft bitopological spaces. Also, we introduce the concepts of fibrewise closed soft bitopological spaces, fibrewise open soft bitopological spaces, fibrewise locally sliceable soft bitopological spaces and fibrewise locally sectionable soft bitopological spaces. Furthermore, we state and prove several propositions concerning these concepts.
A (k,n)-arc is a set of k points of PG(2,q) for some n, but not n + 1 of them, are collinear. A (k,n)-arc is complete if it is not contained in a (k + 1,n)-arc. In this paper we construct complete (kn,n)-arcs in PG(2,5), n = 2,3,4,5, by geometric method, with the related blocking sets and projective codes.