Linear programming currently occupies a prominent position in various fields and has wide applications, as its importance lies in being a means of studying the behavior of a large number of systems as well. It is also the simplest and easiest type of models that can be created to address industrial, commercial, military and other dilemmas. Through which to obtain the optimal quantitative value. In this research, we dealt with the post optimality solution, or what is known as sensitivity analysis, using the principle of shadow prices. The scientific solution to any problem is not a complete solution once the optimal solution is reached. Any change in the values of the model constants or what is known as the inputs of the model that will change the problem of linear programming and will affect the optimal solution, and therefore we need a method that helps us to stand on the impact of changing these constants on the optimal solution that has been reached. General concepts about the binary model and some related theories have also been addressed. By analyzing the sensitivity, we relied on real data for a company that transports crude oil and its derivatives. The mathematical model was formulated for it and the optimal solution was reached using the software. Ready-made sop WINQSB and then calculate the shadow price values for the binding constraints, in addition to what
This paper presents seven modified Adomian Decomposition Method (ADM) techniques for efficiently solving initial value problems, especially those involving non-homogeneous and nonlinear differential equations. While the classical ADM is effective for linear homogeneous cases, it has difficulties solving more complex problems. The proposed modifications—from MADM1 to MLADM—include Maclaurin and Taylor expansions, Laplace transforms, and single-step iterations.• These modifications enhance convergence, reduce complexity, and improve accuracy.• Each method offers specific advantages, such as accelerating convergence (MADM2, RADM4), simplifying computation (TSADM5), and achieving higher accuracy (MLADM).• Numerical examples confirm th
... Show MoreIn this paper, we designed a new efficient stream cipher cryptosystem that depend on a chaotic map to encrypt (decrypt) different types of digital images. The designed encryption system passed all basic efficiency criteria (like Randomness, MSE, PSNR, Histogram Analysis, and Key Space) that were applied to the key extracted from the random generator as well as to the digital images after completing the encryption process.
A new method based on the Touchard polynomials (TPs) was presented for the numerical solution of the linear Fredholm integro-differential equation (FIDE) of the first order and second kind with condition. The derivative and integration of the (TPs) were simply obtained. The convergence analysis of the presented method was given and the applicability was proved by some numerical examples. The results obtained in this method are compared with other known results.
The current research aims to: 1- Identify the emotional sensitivity of children from the parents' point of view. 2- Identifying the differences in the emotional sensitivity of children from the parents ’point of view, according to the parents’ gender variable (father - mother). The basic research sample consisted of (285) male and female students from the sixth grade (primary school), chosen in a randomized stratified method from the districts (Al-Karkh and AlRasafa). While the sample of statistical analysis amounted to (200) father and (200) mothers of male and female students who were randomly selected from the sixth grade of the education directorates (Al-Karkh and Al-Rasafa). The two researchers also used a number of sta
... Show MoreIn this paper, Touchard polynomials (TPs) are presented for solving Linear Volterra integral equations of the second kind (LVIEs-2k) and the first kind (LVIEs-1k) besides, the singular kernel type of this equation. Illustrative examples show the efficiency of the presented method, and the approximate numerical (AN) solutions are compared with one another method in some examples. All calculations and graphs are performed by program MATLAB2018b.
This paper generalizes and improves the results of Margenstren, by proving that the number of -practical numbers which is defined by has a lower bound in terms of . This bound is more sharper than Mangenstern bound when Further general results are given for the existence of -practical numbers, by proving that the interval contains a -practical for all
Review of multidrug sensitivity and resistance in enterococcus