Abstract

     This research deals with Building A probabilistic Linear programming model  representing, the operation of production in the Middle Refinery Company (Dura, Semawa, Najaif) Considering the demand of each product (Gasoline, Kerosene,Gas Oil, Fuel Oil ).are random variables ,follows certain probability distribution, which are testing by using Statistical programme (Easy fit), thes distribution are found to be Cauchy distribution ,Erlang distribution ,Pareto distribution ,Normal distribution ,and General Extreme value distribution .              &

This paper presents a grey model GM(1,1) of the first rank and a variable one and is the basis of the grey system theory , This research dealt  properties of grey model and a set of methods to estimate parameters of the grey model GM(1,1)  is the least square Method (LS) , weighted least square method (WLS), total least square method (TLS) and gradient descent method  (DS). These methods were compared based on two types of standards: Mean square error (MSE), mean absolute percentage error (MAPE), and after comparison using simulation the best method was applied to real data represented by the rate of consumption of the two types of oils a Heavy fuel (HFO) and diesel fuel (D.O) and has been applied several tests to

summary

In this search, we examined the factorial experiments and the study of the significance of the main effects, the interaction of the factors and their simple effects by the F test (ANOVA) for analyze the data of the factorial experience. It is also known that the analysis of variance requires several assumptions to achieve them, Therefore, in case of violation of one of these conditions we conduct a transform to the data in order to match or achieve the conditions of analysis of variance, but it was noted that these transfers do not produce accurate results, so we resort to tests or non-parametric methods that work as a solution or alternative to the parametric tests , these method

These search summaries in building a mathematical model to the issue of Integer linear Fractional programming and finding the best solution of Integer linear Fractional programming (I.L.F.P) that maximize the productivity of the company^,s revenue by using the largest possible number of production units and maximizing denominator objective which represents^,s proportion of profits to the costs, thus maximizing total profit of the company at the lowest cost through using Dinkelbach algorithm and the complementary method on the Light industries company data for 2013 and comparing results with Goal programming methods results.

It is clear that the final results of resolution and Dinkelbac

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.