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 for promising.
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
In this paper, several types of space-time fractional partial differential equations has been solved by using most of special double linear integral transform â€double Sumudu â€. Also, we are going to argue the truth of these solutions by another analytically method “invariant subspace methodâ€. All results are illustrative numerically and graphically.
In this paper we estimate the coefficients and scale parameter in linear regression model depending on the residuals are of type 1 of extreme value distribution for the largest values . This can be regard as an improvement for the studies with the smallest values . We study two estimation methods ( OLS & MLE ) where we resort to Newton – Raphson (NR) and Fisher Scoring methods to get MLE estimate because the difficulty of using the usual approach with MLE . The relative efficiency criterion is considered beside to the statistical inference procedures for the extreme value regression model of type 1 for largest values . Confidence interval , hypothesis testing for both scale parameter and regression coefficients
... Show MoreMany production companies suffers from big losses because of high production cost and low profits for several reasons, including raw materials high prices and no taxes impose on imported goods also consumer protection law deactivation and national product and customs law, so most of consumers buy imported goods because it is characterized by modern specifications and low prices.
The production company also suffers from uncertainty in the cost, volume of production, sales, and availability of raw materials and workers number because they vary according to the seasons of the year.
I had adopted in this research fuzzy linear program model with fuzzy figures
... Show MoreIn this paper, a new seven-parameter Mittag-Leffler function of a single com-plex variable is proposed as a generalization of the standard Mittag-Leffler function, certain generalizations of Mittag-Leffler function, hypergeometric function and confluent hypergeometric function. Certain essential analytic properties are mainly discussed, such as radius of convergence, order, type, differentiation, Mellin-Barnes integral representation and Euler transform in the complex plane. Its relation to Fox-Wright function and H-function is also developed.
At present, the ability to promote national economy by adjusting to political, economic, and technological variables is one of the largest challenges faced by organization productivity. This challenge prompts changes in structure and line productivity, given that cash has not been invested. Thus, the management searches for investment opportunities that have achieved the optimum value of the annual increases in total output value of the production line workers in the laboratory. Therefore, the application of dynamic programming model is adopted in this study by addressing the division of investment expenditures to cope with market-dumping policy and to strive non-stop production at work.
The purpose of this project is to build a scientific base and computational programs in an accelerator design work. The transfer of group of laws in alinear accelerator cavity to computer codes written in Fortran power station language is inorder to get a numerical calculation of an electromagnetic field generated in the cavities of the linear accelerator. The program in put contains mainly the following, the geometrical cavity constant, and the triangular finite element method high – order polynomial. The out put contains vertical and horizontal components of the electrical field together with the electrical and the magnetic field intensity.
In this paper, we study the growth of solutions of the second order linear complex differential equations insuring that any nontrivial solutions are of infinite order. It is assumed that the coefficients satisfy the extremal condition for Yang’s inequality and the extremal condition for Denjoy’s conjecture. The other condition is that one of the coefficients itself is a solution of the differential equation .
This paper studies a novel technique based on the use of two effective methods like modified Laplace- variational method (MLVIM) and a new Variational method (MVIM)to solve PDEs with variable coefficients. The current modification for the (MLVIM) is based on coupling of the Variational method (VIM) and Laplace- method (LT). In our proposal there is no need to calculate Lagrange multiplier. We applied Laplace method to the problem .Furthermore, the nonlinear terms for this problem is solved using homotopy method (HPM). Some examples are taken to compare results between two methods and to verify the reliability of our present methods.
Algorithms using the second order of B -splines [B (x)] and the third order of B -splines [B,3(x)] are derived to solve 1' , 2nd and 3rd linear Fredholm integro-differential equations (F1DEs). These new procedures have all the useful properties of B -spline function and can be used comparatively greater computational ease and efficiency.The results of these algorithms are compared with the cubic spline function.Two numerical examples are given for conciliated the results of this method.