The aim of this research is to compare traditional and modern methods to obtain the optimal solution using dynamic programming and intelligent algorithms to solve the problems of project management.

It shows the possible ways in which these problems can be addressed, drawing on a schedule of interrelated and sequential activities And clarifies the relationships between the activities to determine the beginning and end of each activity and determine the duration and cost of the total project and estimate the times used by each activity and determine the objectives sought by the project through planning, implementation and monitoring to maintain the budget assessed 

Many of the dynamic processes in different sciences are described by models of differential equations. These models explain the change in the behavior of the studied process over time by linking the behavior of the process under study with its derivatives. These models often contain constant and time-varying parameters that vary according to the nature of the process under study in this We will estimate the constant and time-varying parameters in a sequential method in several stages. In the first stage, the state variables and their derivatives are estimated in the method of penalized splines(p- splines) . In the second stage we use pseudo lest square to estimate constant parameters, For the third stage, the rem

In this research was to use the method of classic dynamic programming (CDP) and the method of fuzzy dynamic programming (FDP) to controlling the inventory in N periods and only one substance ,in order to minimize the total cost and determining the required quantity in warehouse rusafa principal of the ministry of commerce . A comparison was made between the two techniques، We found that the value of fuzzy total cost is less than that the value of classic total cost

The goal (purpose) from using development technology that require mathematical procedure related with high Quality & sufficiency of solving complex problem called Dynamic Programming with in recursive method (forward & backward) through  finding series of associated decisions for reliability function of Pareto distribution estimator by using two approach Maximum likelihood & moment .to conclude optimal policy

 ABSTRICT:

  This study is concerned with the estimation of constant  and time-varying parameters in non-linear ordinary differential equations, which do not have analytical solutions. The estimation is done in a multi-stage method where constant and time-varying parameters are estimated in a straight sequential way from several stages. In the first stage, the model of the differential equations is converted to a regression model that includes the state variables with their derivatives and then the estimation of the state variables and their derivatives in a penalized splines method and compensating the estimations in the regression model. In the second stage, the pseudo- least squares method was used to es

      The aim of this research is to solve a real problem in the Department of Economy and Investment in the Martyrs establishment, which is the selection of the optimal project through specific criteria by experts in the same department using a combined mathematical model for the two methods of analytic hierarchy process and goal programming, where a mathematical model for goal programming was built that takes into consideration the priorities of the goal criteria by the decision-maker to reach the best solution that meets all the objectives, whose importance was determined by the hierarchical analysis process. The most important result of this research is the selection of the second pro

Stumpff functions are an infinite series that depends on the value of z. This value results from multiplying the reciprocal semi-major axis with a universal anomaly. The purpose from those functions is to calculate the variation of the universal parameter (variable) using Kepler's equation for different orbits. In this paper, each range for the reciprocal of the semi-major axis, universal anomaly, and z is calculated in order to study the behavior of Stumpff functions C(z) and S(z). The results showed that when z grew, Stumpff functions for hyperbola, parabola, and elliptical orbits were also growing. They intersected and had a tendency towards zero for both hyperbola and parabola orbits, but for elliptical orbits, Stumpff functions

This paper focuses on developing a self-starting numerical approach that can be used for direct integration of higher-order initial value problems of Ordinary Differential Equations. The method is derived from power series approximation with the resulting equations discretized at the selected grid and off-grid points. The method is applied in a block-by-block approach as a numerical integrator of higher-order initial value problems. The basic properties of the block method are investigated to authenticate its performance and then implemented with some tested experiments to validate the accuracy and convergence of the method.