Simulated annealing (SA) has been an effective means that can address difficulties related to optimization problems. is now a common discipline for research with several productive applications such as production planning. Due to the fact that aggregate production planning (APP) is one of the most considerable problems in production planning, in this paper, we present multi-objective linear programming model for APP and optimized by . During the course of optimizing for the APP problem, it uncovered that the capability of was inadequate and its performance was substandard, particularly for a sizable controlled problem with many decision variables and plenty of constraints. Since this algorithm works sequentially then the current state wi

The techniques of fractional calculus are applied successfully in many branches of science and engineering, one of the techniques is the Elzaki Adomian decomposition method (EADM), which researchers did not study with the fractional derivative of Caputo Fabrizio. This work aims to study the Elzaki Adomian decomposition method (EADM) to solve fractional differential equations with the Caputo-Fabrizio derivative. We presented the algorithm of this method with the CF operator and discussed its convergence by using the method of the Cauchy series then, the method has applied to solve Burger, heat-like, and, couped Burger equations with the Caputo -Fabrizio operator. To conclude the method was convergent and effective for solving this type of

Let R be a commutative ring with identity, and let M be a unity R-module. M is called a bounded R-module provided that there exists an element x?M such that annR(M) = annR(x). As a generalization of this concept, a concept of semi-bounded module has been introduced as follows: M is called a semi-bounded if there exists an element x?M such that . In this paper, some properties and characterizations of semi-bounded modules are given. Also, various basic results about semi-bounded modules are considered. Moreover, some relations between semi-bounded modules and other types of modules are considered.

     The focus of this article is to add a new class of rank one of  modified Quasi-Newton techniques to solve the problem of unconstrained optimization by updating the inverse Hessian matrix with an update of rank 1, where a diagonal matrix is the first component of the next inverse Hessian approximation, The inverse Hessian matrix is  generated by the method proposed which is symmetric and it satisfies the condition of modified quasi-Newton, so the global convergence is retained. In addition, it is positive definite that  guarantees the existence of the minimizer at every iteration of the objective function. We use  the program MATLAB to solve an algorithm function to introduce the feasibility of

     The purpose of this paper is to introduce dual notions of two known concepts which are semi-essential submodules and semi-uniform modules. We call these concepts; cosemi-essential submodules and cosemi-uniform modules respectively. Also, we verify that these concepts form generalizations of two well-known classes; coessential submodules and couniform modules respectively. Some conditions are considered to obtain the equivalence between cosemi-uniform and couniform. Furthermore, the relationships of cosemi-uniform module with other related concepts are studied, and some conditional characterizations of cosemi-uniform modules are investigated.

      Faintly continuous (FC) functions, entitled faintly S-continuous and faintly δS-continuous functions have been introduced and investigated via a -open and -open sets. Several characterizations and properties of faintly S-continuous and faintly -Continuous functions were obtained. In addition, relationships between faintly s- Continuous and faintly S-continuous function and other forms of FC function were investigated. Also, it is shown that every faintly  S-continuous is weakly S-continuous. The Convers is shown to be satisfied only if the co-domain of the function is almost regular.

In this research article, an Iterative Decomposition Method is applied to approximate linear and non-linear fractional delay differential equation. The method was used to express the solution of a Fractional delay differential equation in the form of a convergent series of infinite terms which can be effortlessly computable.
The method requires neither discretization nor linearization. Solutions obtained for some test problems using the proposed method were compared with those obtained from some methods and the exact solutions. The outcomes showed the proposed approach is more efficient and correct.