In this paper,the homtopy perturbation method (HPM) was applied to obtain the approximate solutions of the fractional order integro-differential equations . The fractional order derivatives and fractional order integral are described in the Caputo and Riemann-Liouville sense respectively. We can easily obtain the solution from convergent the infinite series of HPM . A theorem for convergence and error estimates of the HPM for solving fractional order integro-differential equations was given. Moreover, numerical results show that our theoretical analysis are accurate and the HPM can be considered as a powerful method for solving fractional order integro-diffrential equations.

The main work of this paper is devoted to a new technique of constructing approximated solutions for linear delay differential equations using the basis functions power series functions with the aid of Weighted residual methods (collocations method, Galerkin’s method and least square method).

  There are many researches deals with constructing an efficient solutions for real problem having Multi - objective confronted with each others. In this paper we construct a decision for Multi – objectives based on building a mathematical model formulating a unique objective function by combining the confronted objectives functions. Also we are presented some theories concerning this problem. Areal application problem has been presented to show the efficiency of the performance of our model and the method. Finally we obtained some results by randomly generating some problems.

This paper aims to propose a hybrid approach of two powerful methods, namely the differential transform and finite difference methods, to obtain the solution of the coupled Whitham-Broer-Kaup-Like equations which arises in shallow-water wave theory. The capability of the method to such problems is verified by taking different parameters and initial conditions. The numerical simulations are depicted in 2D and 3D graphs. It is shown that the used approach returns accurate solutions for this type of problems in comparison with the analytic ones.

The research aims to find approximate solutions for two dimensions Fredholm linear integral equation. Using the two-variables of the Bernstein polynomials we find a solution to the approximate linear integral equation of the type two dimensions. Two examples have been discussed in detail.

In this paper, an approximate solution of nonlinear two points boundary variational problem is presented. Boubaker polynomials have been utilized to reduce these problems into quadratic programming problem. The convergence of this polynomial has been verified; also different numerical examples were given to show the applicability and validity of this method.

The study deals with the issue of multi-choice linear mathematical programming. The right side of the constraints will be multi-choice. However, the issue of multi-purpose mathematical programming can not be solved directly through linear or nonlinear techniques. The idea is to transform this matter into a normal linear problem and solve it In this research, a simple technique is introduced that enables us to deal with this issue as regular linear programming. The idea is to introduce a number of binary variables And its use to create a linear combination gives one parameter was used multiple. As well as the options of linear programming model to maximize profits to the General Company for Plastic Industries product irrigation sy

The Detour distance is one of the most common distance types used in chemistry and computer networks today. Therefore, in this paper, the detour polynomials and detour indices of vertices identified of n-graphs which are connected to themselves and separated from each other with respect to the vertices for n≥3 will be obtained. Also, polynomials detour and detour indices will be found for another graphs which have important applications in Chemistry.

In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:

 respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.