While analytical solutions to Quadratic Assignment Problems (QAP) have indeed been since a long time, the expanding use of Evolutionary Algorithms (EAs) for similar issues gives a framework for dealing with QAP with an extraordinarily broad scope. The study's key contribution is that it normalizes all of the criteria into a single scale, regardless of their measurement systems or the requirements of minimum or maximum, relieving the researchers of the exhaustively quantifying the quality criteria. A tabu search algorithm for quadratic assignment problems (TSQAP) is proposed, which combines the limitations of tabu search with a discrete assignment problem. The effectiveness of the proposed technique has been compared to well-established a

Multiple linear regressions are concerned with studying and analyzing the relationship between the dependent variable and a set of explanatory variables. From this relationship the values of variables are predicted. In this paper the multiple linear regression model and three covariates were studied in the presence of the problem of auto-correlation of errors when the random error distributed the distribution of exponential. Three methods were compared (general least squares, M robust, and Laplace robust method). We have employed the simulation studies and calculated the statistical standard mean squares error with sample sizes (15, 30, 60, 100). Further we applied the best method on the real experiment data representing the varieties of

 Reduction represents a form of artistic abstraction to express things with formal symbols that suggest the content of the idea, as the beauty of the design artwork cannot be unique in the form only, but in revealing its meaning as well. He resorts to shorthand to express the content of his idea related to design necessities and needs to achieve a specific function whose role is crystallized through the form that follows the function. The importance of the research was also represented in: Benefiting workers and scholars in the field of design with regard to shorthand and implicit in graphic design. The aim of the research: to identify the relationship between implicit meaning and reduced forms in graphic design. And the aesthetic of fo

This research aims to numerically solve a nonlinear initial value problem presented as a system of ordinary differential equations. Our focus is on epidemiological systems in particular. The accurate numerical method that is the Runge-Kutta method of order four has been used to solve this problem that is represented in the epidemic model. The COVID-19 mathematical epidemic model in Iraq from 2020 to the next years is the application under study. Finally, the results obtained for the COVID-19 model have been discussed tabular and graphically. The spread of the COVID-19 pandemic can be observed via the behavior of the different stages of the model that approximates the behavior of actual the COVID-19 epidemic in Iraq. In our study, the COV

     The aim of this paper is to study the nonlinear delay second order eigenvalue problems which consists of delay ordinary differential equations, in fact one of the expansion methods that is called the least square method which will be developed to solve this kind of problems.

This study is dedicated to solving multicollinearity problem for the general linear model by using Ridge regression method. The basic formulation of this method and suggested forms for Ridge parameter is applied to the Gross Domestic Product data in Iraq. This data has normal distribution. The best linear regression model is obtained after solving multicollinearity problem with the suggesting of 10 k value.

In this paper Volterra Runge-Kutta methods which include: method of order two and four will be applied to general nonlinear Volterra integral equations of the second kind. Moreover we study the convergent of the algorithms of Volterra Runge-Kutta methods. Finally, programs for each method are written in MATLAB language and a comparison between the two types has been made depending on the least square errors.

In this paper, a new technique is offered for solving three types of linear integral equations of the 2^nd kind including Volterra-Fredholm integral equations (LVFIE) (as a general case), Volterra integral equations (LVIE) and Fredholm integral equations (LFIE) (as special cases). The new technique depends on approximating the solution to a polynomial of degree  and therefore reducing the problem to a linear programming problem(LPP), which will be solved to find the approximate solution of LVFIE. Moreover, quadrature methods including trapezoidal rule (TR), Simpson 1/3 rule (SR), Boole rule (BR), and Romberg integration formula (RI) are used to approximate the integrals that exist in LVFIE. Also, a comparison between those

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.

This paper presents a new transform method to solve partial differential equations, for finding suitable accurate solutions in a wider domain. It can be used to solve the problems without resorting to the frequency domain. The new transform is combined with the homotopy perturbation method in order to solve three dimensional second order partial differential equations with initial condition, and the convergence of the solution to the exact form is proved. The implementation of the suggested method demonstrates the usefulness in finding exact solutions. The practical implications show the effectiveness of approach and it is easily implemented in finding exact solutions.

       Finally, all algori