Original Research Paper Mathematics 1-Introduction : In the light of the progress and rapid development of the applications of research in applications fields, the need to rely on scientific tools and cleaner for data processing has become a prominent role in the resolution of decisions in industrial and service institutions according to the real need of these methods to make them scientific methods to solve the problem Making decisions for the purpose of making the departments succeed in performing their planning and executive tasks. Therefore, we found it necessary to know the transport model in general and to use statistical methods to reach the optimal solution with the lowest possible costs in particular. And you know The Transportation Problem (also called Hitchcock Problem and denoted by TP) is one of the classic problems in operation research, a special type of linear programming problem(2): Where : cij = unit transportation cost for each source i to destination j. xij = number of units from source to destination. ai = supply from sources ; bj= demand from destination We have to determine the optimal shipments from a given set of origins to a given set of destinations in such a way as to minimize the total (7) transportation costs. Have been widely studied in computer science and operations research. It is one of the fundamental problems of network flow problem which is usually use to minimize the transportation cost for industries with number of sources and number of destination while (1) satisfying the supply limit and demand requirement. The problem is constrained by known upper limits on the supply at the various origins and by the necessity to satisfy the known demand at each destination. The classical transportation model assumes that the per unit cost for each potential origin destination pair is known a (2) priori. It was first studied by F. L. Hitchcock in 1941, then separately by T. C. Koopmans in 1947, and finally placed in the framework of linear programming and solved by simplex method by G. B. Dantzig in 1951 (3)(4) .The first step of the simplex method for the transportation problem is to determine an initial basic feasible solution. The simplest procedure for finding an initial basic feasible solution was proposed by Dantzig (1951) and was termed the northwest corner rule by charnes (5)
The exchanges in various fields,like economics, science, culture, etc., have been enhanced unceasingly among different countries around the world in the twenty-first century, thus, the university graduate who masters one foreign language does not meet the need of the labor market in most countries.So, many universities began to develop new programs to cultivate students who can use more foreign languages to serve the intercultural communication. At the same time, there is more scientific research emerged which is related to the relationship between the second and third languages. This humble research seeks to explain the relevant concepts and analyze the real data collected from Shanghai International Studies University in China, to expl
... Show MoreIn this paper, three approximate methods namely the Bernoulli, the Bernstein, and the shifted Legendre polynomials operational matrices are presented to solve two important nonlinear ordinary differential equations that appeared in engineering and applied science. The Riccati and the Darcy-Brinkman-Forchheimer moment equations are solved and the approximate solutions are obtained. The methods are summarized by converting the nonlinear differential equations into a nonlinear system of algebraic equations that is solved using Mathematica®12. The efficiency of these methods was investigated by calculating the root mean square error (RMS) and the maximum error remainder (𝑀𝐸𝑅n) and it was found that the accuracy increases with increasi
... Show More
A finite element is a study that is capable of predicting crack initiation and simulating crack propagation of human bone. The material model is implemented in MATLAB finite element package, which allows extension to any geometry and any load configuration. The fracture mechanics parameters for transverse and longitudinal crack propagation in human bone are analyzed. A fracture toughness as well as stress and strain contour are generated and thoroughly evaluated. Discussion is given on how this knowledge needs to be extended to allow prediction of whole bone fracture from external loading to aid the design of protective systems.
(5)
(8)
(5)
Abstract
The project of balad's major sewerage system is one of the biggest projects who is still in progress in salahulddin province provincial - development plan that was approved in 2013 . This project works in two parts ; the 1st is installing the sewerage networks (both of heavy sewerage & rain sewerage) and the 2nd is installing the life – off units (for heavy sewerage & rain sewerage , as well) . the directorate of salahuiddin is aiming that at end of construction it will be able to provide services for four residential quarters , one of the main challenges that project's management experience is how to achieve thes
... Show More
The aim of this paper is to propose an efficient three steps iterative method for finding the zeros of the nonlinear equation f(x)=0 . Starting with a suitably chosen , the method generates a sequence of iterates converging to the root. The convergence analysis is proved to establish its five order of convergence. Several examples are given to illustrate the efficiency of the proposed new method and its comparison with other methods.
In this paper, we introduce an approximate method for solving fractional order delay variational problems using fractional Euler polynomials operational matrices. For this purpose, the operational matrices of fractional integrals and derivatives are designed for Euler polynomials. Furthermore, the delay term in the considered functional is also decomposed in terms of the operational matrix of the fractional Euler polynomials. It is applied and substituted together with the other matrices of the fractional integral and derivative into the suggested functional. The main equations are then reduced to a system of algebraic equations. Therefore, the desired solution to the original variational problem is obtained by solving the resul
... Show More
(1)
Metaheuristic is one of the most well-known fields of research used to find optimum solutions for non-deterministic polynomial hard (NP-hard) problems, for which it is difficult to find an optimal solution in a polynomial time. This paper introduces the metaheuristic-based algorithms and their classifications and non-deterministic polynomial hard problems. It also compares the performance of two metaheuristic-based algorithms (Elephant Herding Optimization algorithm and Tabu Search) to solve the Traveling Salesman Problem (TSP), which is one of the most known non-deterministic polynomial hard problems and widely used in the performance evaluations for different metaheuristics-based optimization algorithms. The experimental results of Ele
... Show More
(8)
The aim of this paper is to present a semi - analytic technique for solving singular initial value problems of ordinary differential equations with a singularity of different kinds to construct polynomial solution using two point osculatory interpolation. The efficiency and accuracy of suggested method is assessed by comparisons with exact and other approximate solutions for a wide classes of non–homogeneous, non–linear singular initial value problems. A new, efficient estimate of the global error is used for adaptive mesh selection. Also, analyze some of the numerical aspects
... Show More