تناول البحث حل مشكلة النقل باستخدام مدخل بحوث العملٌات فً مرحلة التحلٌل والتصمٌم لنموذج المشكلة , وتم مقارنة النتائج التً حصلنا علٌها من الحلول لصٌاؼة التحلٌل وبرهنة صحة النموذج المتجه صوب الموضوع, وتم اجراء المقارنة بٌن الحلول المختلفة الختٌار اقل قٌمة لدالة الهدؾ لكً ٌتمكن المستفٌد من صنع القرار, باستخدام الطرق االربعة )طرٌقة الزاوٌة الشمالٌة الؽربٌة, طرٌقة اقل التكالٌؾ, طرٌقة فوجل التقرٌبٌة, الطرٌقة ال

One of the most important elements of achieving food security is livestock, which is an essential element in the agricultural sector, and is one of the state support sectors. Animal production (sheep) ranked an important position in this sector due to the economic advantages that are available when rearing. Moreover, the success and development of sheep breeding depend on several factors, including financial return and achieving profitability. The study aims to identify the phenomenon size of random slaughter as a problem, which spread in Baghdad and its causes and the factors that influencing its development. As well as, the possibility of applying the idea of a​​mobile slaughterhouse to reduce this phenomen

This paper studies a novel technique based on the use of two effective methods like modified Laplace- variational method (MLVIM) and a new Variational method (MVIM)to solve PDEs with variable coefficients. The current modification for the (MLVIM) is based on coupling of the Variational method (VIM) and Laplace- method (LT). In our proposal there is no need to calculate Lagrange multiplier. We applied Laplace method to the problem .Furthermore, the nonlinear terms for this problem is solved using homotopy method (HPM). Some examples are taken to compare results between two methods and to verify the reliability of our present methods.

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.

Abstract

  The logistic regression model is one of the nonlinear models that aims at obtaining highly efficient capabilities, It also the researcher an idea of the effect of the explanatory variable on the binary response variable.                                                                                  &nb

This research introduce a study with application on Principal Component Regression obtained from some of the explainatory variables to limitate Multicollinearity problem among these variables and gain staibilty in their estimations more than those which yield from Ordinary Least Squares. But the cost that we pay in the other hand losing a little power of the estimation of the predictive regression function in explaining the essential variations. A suggested numerical formula has been proposed and applied by the researchers as optimal solution, and vererifing the its efficiency by a program written by the researchers themselves for this porpuse through some creterions: Cumulative Percentage Variance, Coefficient of Determination, Variance

Is in this research review of the way minimum absolute deviations values ​​based on linear programming method to estimate the parameters of simple linear regression model and give an overview of this model. We were modeling method deviations of the absolute values ​​proposed using a scale of dispersion and composition of a simple linear regression model based on the proposed measure. Object of the work is to find the capabilities of not affected by abnormal values by using numerical method and at the lowest possible recurrence.

In the present paper, three reliable iterative methods are given and implemented to solve the 1D, 2D and 3D Fisher’s equation. Daftardar-Jafari method (DJM), Temimi-Ansari method (TAM) and Banach contraction method (BCM) are applied to get the exact and numerical solutions for Fisher's equations. The reliable iterative methods are characterized by many advantages, such as being free of derivatives, overcoming the difficulty arising when calculating the Adomian polynomial boundaries to deal with nonlinear terms in the Adomian decomposition method (ADM), does not request to calculate Lagrange multiplier as in the Variational iteration method (VIM) and there is no need to create a homotopy like in the Homotopy perturbation method (H