The definition of semi-preopen sets were first introduced by "Andrijevic" as were is defined by :Let (X ,  ) be a topological space, and let  A ⊆,    then Ais called semi-preopen set if ⊆∘ .        In this paper, we study the properties of semi-preopen sets but by another  definition which is equivalent to the first definition and we also study the relationships among it and (open, α-open, preopen and semi-p-open )sets.

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 research demonstrates new species of the games by applying separation axioms via  sets, where the relationships between the various species that were specified and the strategy of winning and losing to any one of the players, and their relationship with the concepts of separation axioms via  sets have been studied.

The fuzzy sets theory has been applied in many fields, such as operations research, control theory and management sciences, etc. In particular, an application of this theory in decision making problem is linear programming problems with fuzzy technological coefficients numbers, as well as studying the parametric linear programming problems in the case of changes in the objective function. In this paper presenting a new procedure which connects and makes link between fuzzy linear programming problem with fuzzy technological coefficients numbers and parametric linear programming problem with change in coefficients of the objective function, then develop a numerical example illustrates the steps of solution to this kind of problems.

We use the idea of the grill. This study generalized a new sort of linked space like -connected and -hyperconnected and investigated its features, as well as the relationship between it and previously described notions. It also developed new sorts of functions, such as hyperconnected space, and identified their relationship by offering numerous instances and attributes that belong to this set. This set will serve as a starting point for further research into the set many future possibilities. We also use some theorems and observations previously studied and related to the grill and the semi-open to obtain results in this research. We applied the concept of connected to them and obtained results related to connected. The sources related t

In this article, the notions  are introduced by using soft ideal and soft semi-open sets, which are - - - -closed sets " -closed" where many of the properties of these sets are clarified. Some games by using soft- -semi, soft separation axioms: like ( ₀   ( ₀  Using many figures and proposition to study the relationships among these kinds of games with some examples are explained.

Let R be a Г-ring, and σ, τ be two automorphisms of R. An additive mapping d from a Γ-ring R into itself is called a (σ,τ)-derivation on R if d(aαb) = d(a)α σ(b) + τ(a)αd(b), holds for all a,b ∈R and α∈Γ. d is called strong commutativity preserving (SCP) on R if [d(a), d(b)]_α = [a,b]_α^(σ,τ) holds for all a,b∈R and α∈Γ. In this paper, we investigate the commutativity of R by the strong commutativity preserving (σ,τ)-derivation d satisfied some properties, when R is prime and semi prime Г-ring.