This paper presents a linear fractional programming problem (LFPP) with rough interval coefficients (RICs) in the objective function. It shows that the LFPP with RICs in the objective function can be converted into a linear programming problem (LPP) with RICs by using the variable transformations. To solve this problem, we will make two LPP with interval coefficients (ICs). Next, those four LPPs can be constructed under these assumptions; the LPPs can be solved by the classical simplex method and used with MS Excel Solver. There is also argumentation about solving this type of linear fractional optimization programming problem. The derived theory can be applied to several numerical examples with its details, but we show only two examples

In this paper, the dynamical behavior of a three-dimensional fractional-order prey-predator model is investigated with Holling type III functional response and constant rate harvesting. It is assumed that the middle predator species consumes only the prey species, and the top predator species consumes only the middle predator species. We also prove the boundedness, the non-negativity, the uniqueness, and the existence of the solutions of the proposed model. Then, all possible equilibria are determined, and the dynamical behaviors of the proposed model around the equilibrium points are investigated. Finally, numerical simulations results are presented to confirm the theoretical results and to give a better understanding of the dynami

        This paper is concerned with the solution of the nanoscale structures consisting of the   with an effective mass envelope function theory, the electronic states of the  quantum ring are studied.  In calculations, the effects due to the different effective masses of electrons in and out the rings are included. The energy levels of the electron are calculated in the different shapes of rings, i.e., that the inner radius of rings sensitively change the electronic states. The energy levels of the electron are not sensitively dependent on the outer radius for large rings. The structures of  quantum rings are studied by the one electronic band Hamiltonian effective mass approximati

A method for Approximated evaluation of linear functional differential equations is described. where a function approximation as a linear combination of a set of orthogonal basis functions which are chebyshev functions .The coefficients of the approximation are determined by (least square and Galerkin’s) methods. The property of chebyshev polynomials leads to good results , which are demonstrated with examples.

In this paper we use Bernstein polynomials for deriving the modified Simpson's 3/8 , and the composite modified Simpson's 3/8 to solve one dimensional linear Volterra integral equations of the second kind , and we find that the solution computed by this procedure is very close to exact solution.

   This paper applies the Modified Adomian Decomposition Method (MADM) for solving Integro-Differential Inequality, this method  is one of effective to construct analytic approximate solutions for linear and nonlinear integro-differential inequalities without solving many integrals and transformed or discretization. Several examples are presented, the analytic results show that this method is a promising and powerful for solving these problems.

Elzaki Transform Adomian decomposition technique (ETADM), which an elegant combine, has been employed in this work to solve non-linear Riccati matrix differential equations. Solutions are presented to demonstrate the relevance of the current approach. With the use of figures, the results of the proposed strategy are displayed and evaluated. It is demonstrated that the suggested approach is effective, dependable, and simple to apply to a range of related scientific and technical problems.

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.