Loading...
Search for: realization
0.072 seconds

    Effective Optimization of Oil Production by Waterflooding

    , Ph.D. Dissertation Sharif University of Technology Yasari, Elham (Author) ; Pishvaie, Mahmoud Reza (Supervisor) ; Khorasheh, Farhad (Supervisor) ; Salahshour, Karim (Supervisor) ; Kharrat, Riyaz (Supervisor)
    Abstract
    Reservoir lifetime optimization is an important issue. The policies that are used for maximum production using optimization methods become challenging in the presence of uncertainty. Robust Optimization (RO) method is a technique to deal with uncertainty. Because of insufficient data, uncertainty is an inherent characteristic of reservoir model. This leads to inexact solutions of an optimization problem. Also, design based on uncertainty in economic parameters, especially uncertain oil price is a challenging issue. Taking the uncertainty explicitly is a solution when there is no measurement available. To take into account uncertainty several possible values (realizations) for the uncertainty... 

    Ranking Realizations of Reservoir Model by Using Well Test Data

    , M.Sc. Thesis Sharif University of Technology Tahmasbi, Mehran (Author) ; Masihi, Mohsen (Supervisor) ; Shad, Saeed (Co-Advisor)
    Abstract
    Characteristic of the reservoir, including the important discussion in the oil industry, is widely practiced in the modeling, simulation and EOR. One of the methods fordetermining the specifications of the reservoir is geostatistical technique. This means that a large number of realizations of the reservoir model to assess the uncertainty in reservoir descriptions of performance predictions should be made.However flow simulation of all these realizations is very difficult due to cost and time calculations.To mend the problem, we use ranking realization that finally a minor number of realizations are selected and flow simulation is used to them.In this project, we use streamline simulation to... 

    Investigating the Conditions of Graphic and Hypergraphic Sequences

    , M.Sc. Thesis Sharif University of Technology Moshfegh, Peyman (Author) ; Mahmoodian, Ebadollah (Supervisor)
    Abstract
    Finding necessary and sufficient conditions for a sequence to be graphic or in more general setting existence of factor with predscribed degree sequence of a general graph and also existence of a polynomial algorithm for finding this factor are classical problems of graph theory. These problems were discussed and solved between 1952 to 1972 by prominent mathematicians such as Erdős, Tutte, Edmonds et al. In this thesis we initially discuss most generalized forms of this problems namely Tutte’s f-factor and Lovasz’ (g; f)-factor theorems. Then some simple generalization of the special cases like Erdős-Gallai and Gale-Ryser theorems are investigated. And by using a form of Lovasz’ (g;...