Markov chains are an application of stochastic models in operation research, helping the analysis and optimization of processes with random events and transitions. The method that will be deployed to obtain the transient solution to a Markov chain problem is an important part of this process. The present paper introduces a novel Ordinary Differential Equation (ODE) approach to solve the Markov chain problem. The probability distribution of a continuous-time Markov chain with an infinitesimal generator at a given time is considered, which is a resulting solution of the Chapman-Kolmogorov differential equation. This study presents a one-step second-derivative method with better accuracy in solving the first-order Initial Value Problem

It is shown that if a subset of a topological space (χ, τ) is δ-semi.closed, then it is semi.closed. By use this fact, we introduce the concept regularity of a topological space (χ, τ) via δ-semi.open sets. Many properties and results were investigated and studied. In addition we study some maps that preserve the δ-semi.regularity of spaces.

In this work we explain and discuss new notion of fibrewise topological spaces, calledfibrewise soft ideal topological spaces, Also, we show the notions of fibrewise closed soft ideal topological spaces, fibrewise open soft ideal topological spaces and fibrewise soft near ideal topological spaces.

In 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

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 Transportatio

Extended utilization of adaptive algorithms, Evaluative Algorithms (EAs), to address these issues offers a way to handle massive multi-objective optimization, even if the algorithmic method for handling combinations of objectives (CO) has been accessible for quite some time. Combining the idea of superiority with the Hypervolume (HV) tag approach, the GSA algorithm utilizes various target effects to explain several algorithms depending on the Hypervolume (HV) spacing. The Multi-objective Gravitational Search Algorithm with Hypervolume (MOGSA/HV). Since rapid convergence could result from GSA foundation work, Hypervolume rewrites the multi-objective problem (MOP) as a sequence of Tchebycheff solutions, improving it. Since the one in charge h

In this paper the oscillation criterion was investigated for all solutions of the third-order half linear neutral differential equations. Some necessary and sufficient conditions are established for every solution of (a(t)[(x(t)±p(t)x(?(t) ) )^'' ]^? )^'+q(t) x^? (?(t) )=0, t?t_0, to be oscillatory. Examples are given to illustrate our main results.