This study presents a practical method for solving fractional order delay variational problems. The fractional derivative is given in the Caputo sense. The suggested approach is based on the Laplace transform and the shifted Legendre polynomials by approximating the candidate function by the shifted Legendre series with unknown coefficients yet to be determined. The proposed method converts the fractional order delay variational problem into a set of (n + 1) algebraic equations, where the solution to the resultant equation provides us the unknown coefficients of the terminated series that have been utilized to approximate the solution to the considered variational problem. Illustrative examples are given to show that the recommended approach is applicable and accurate for solving such kinds of problems.
In this work, we employ a new normalization Bernstein basis for solving linear Freadholm of fractional integro-differential equations nonhomogeneous of the second type (LFFIDEs). We adopt Petrov-Galerkian method (PGM) to approximate solution of the (LFFIDEs) via normalization Bernstein basis that yields linear system. Some examples are given and their results are shown in tables and figures, the Petrov-Galerkian method (PGM) is very effective and convenient and overcome the difficulty of traditional methods. We solve this problem (LFFIDEs) by the assistance of Matlab10.
In this paper, the finite difference method is used to solve fractional hyperbolic partial differential equations, by modifying the associated explicit and implicit difference methods used to solve fractional partial differential equation. A comparison with the exact solution is presented and the results are given in tabulated form in order to give a good comparison with the exact solution
In this paper, we studied the scheduling of jobs on a single machine. Each of n jobs is to be processed without interruption and becomes available for processing at time zero. The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness. This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system. Our lower bound depended on the decomposition of the problem into two subprograms. We presented a novel heuristic approach to find a near-optimal solution for the problem. This approach depends on finding efficient solutions for two problems. The first problem is minimizing total completi
... Show MoreThe Population growth and decay issues are one of the most pressing issues in many sectors of study. These issues can be found in physics, chemistry, social science, biology, and zoology, among other subjects.
We introduced the solution for these problems in this paper by using the SEJI (Sadiq- Emad- Jinan) integral transform, which has some mathematical properties that we use in our solutions. We also presented the SEJI transform for some functions, followed by the inverse of the SEJI integral transform for these functions. After that, we demonstrate how to use the SEJI transform to tackle population growth and decay problems by presenting two applications that demonstrate how to use this transform to obtain solutions.
Fin
... 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 MoreOriginal 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 Transportatio
... Show MoreIn this paper a modified approach have been used to find the approximate solution of ordinary delay differential equations with constant delay using the collocation method based on Bernstien polynomials.
In this paper, a general expression formula for the Boubaker scaling (BS) operational matrix of the derivative is constructed. Then it is used to study a new parameterization direct technique for treating calculus of the variation problems approximately. The calculus of variation problems describe several important phenomena in mathematical science. The first step in our suggested method is to express the unknown variables in terms of Boubaker scaling basis functions with unknown coefficients. Secondly, the operational matrix of the derivative together with some important properties of the BS are utilized to achieve a non-linear programming problem in terms of the unknown coefficients. Finally, the unknown parameters are obtaine
... Show MoreIn this paper, a new hybrid algorithm for linear programming model based on Aggregate production planning problems is proposed. The new hybrid algorithm of a simulated annealing (SA) and particle swarm optimization (PSO) algorithms. PSO algorithm employed for a good balance between exploration and exploitation in SA in order to be effective and efficient (speed and quality) for solving linear programming model. Finding results show that the proposed approach is achieving within a reasonable computational time comparing with PSO and SA algorithms.