The purpose of this paper is to evaluate the error of the approximation of an entire function by some discrete operators in locally global quasi-norms (L_d,p-space), we intend to establish new theorems concerning that Jackson polynomial and Valee-Poussin operator remain within the same bounds as bounded and periodic entire function in locally global norms (L_d,p), (0 < p £ 1).

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 basic goal of this research is to utilize an analytical method which is called the Modified Iterative Method in order to gain an approximate analytic solution to the Sine-Gordon equation. The suggested method is the amalgamation of the iterative method and a well-known technique, namely the Adomian decomposition method. A method minimizes the computational size, averts round-off errors, transformation and linearization, or takes some restrictive assumptions. Several examples are chosen to show the importance and effectiveness of the proposed method. In addition, a modified iterative method gives faster and easier solutions than other methods. These solutions are accurate and in agreement with the series

      In this paper, a new class of ordinary differential equations is designed for some functions such as probability density function, cumulative distribution function, survival function and hazard function of power function distribution, these functions are used of the class under the study. The benefit of our work is that the equations ,which are generated from some probability distributions, are used to model and find  the  solutions  of problems in our lives, and that the solutions of these equations are a solution to these problems, as the solutions of the equations under the study are the closest and the most reliable to reality. The existence and uniqueness of solutions the obtained equations in the current study are dis

In this paper, the series solution is applied to solve third order fuzzy differential equations with a fuzzy initial value. The proposed method applies Taylor expansion in solving the system and the approximate solution of the problem which is calculated in the form of a rapid convergent series; some definitions and theorems are reviewed as a basis in solving fuzzy differential equations. An example is applied to illustrate the proposed technical accuracy. Also, a comparison between the obtained results is made, in addition to the application of the crisp solution, when the-level equals one.

     This paper develop conventional Runge-Kutta methods of order four and order five to solve ordinary differential equations with oscillating solutions. The new modified Runge-Kutta methods (MRK) contain the invalidation of phase lag, phase lag’s derivatives, and amplification error. Numerical tests from their outcomes show the robustness and competence of the new methods compared to the well-known Runge-Kutta methods in the scientific literature.

The swarm intelligence and evolutionary methods are commonly utilized by researchers in solving the difficult combinatorial and Non-Deterministic Polynomial (NP) problems. The N-Queen problem can be defined as a combinatorial problem that became intractable for the large ‘n’ values and, thereby, it is placed in the NP class of problems. In the present study, a solution is suggested for the N-Queen problem, on the basis of the Meerkat Clan Algorithm (MCA). The problem of n-Queen can be mainly defined as one of the generalized 8-Queen problem forms, for which the aim is placing 8 queens in a way that none of the queens has the ability of killing the others with the use of the standard moves of the chess queen. The Meerkat Clan environm