[Home ] [Archive]    
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Registration ::
Main Menu
Home::
Journal Information::
Articles archive::
Submission Instruction::
Registration::
Submit article::
Site Facilities::
Contact us::
::
Google Scholar

Citation Indices from GS

AllSince 2015
Citations4760618470
h-index97
i10-index94

Search in website

Advanced Search
Receive site information
Enter your Email in the following box to receive the site news and information.
:: Search published articles ::
Showing 2 results for Arasteh

Dr. Abdollah Arasteh,
Volume 7, Issue 1 (4-2016)
Abstract

Here, issues connected with characteristic stochastic practices are considered. In the first part, the plausibility of covering the arrangements of an improvement issue on subjective subgraphs is studied. The impulse for this strategy is a state where an advancement issue must be settled as often as possible for discretionary illustrations. Then, a preprocessing stage is considered that would quicken ensuing inquiries by discovering a settled scattered subgraph covering the answer for an arbitrary subgraph with a high likelihood. This outcome is grown to the basic instance of matroids, in addition to advancement issues taking into account the briefest way and resource covering sets. Next, a stochastic improvement model is considered where an answer is sequentially finished by picking an accumulation of “points”. Our crucial idea is the profit of adaptivity, which is investigated for an extraordinary sort of an issue. For the stochastic knapsack issue, the industrious upper and lower cutoff points of the “adaptivity hole” between ideal adaptive and non-adaptive methodologies are checked. Also, an algorithm is described that accomplishes a close ideal estimate. Finally, complicational results are shown to verify the optimal adaptive approaches.
Mr. Aidin Azari Marhabi, Dr. Abdollah Arasteh, Dr. Mohammad Mahdi Paydar,
Volume 10, Issue 1 (7-2019)
Abstract

This paper presents a structure that empower designing supervisory groups to survey the estimation of real options in projects of enormous scale, incompletely standardized frameworks actualized a couple of times over the medium term. Specific options writing is done using a methodology of planning the design and making prior decisions regarding the arrangements of specific options, with a recreation-based value measure designed to be near-current construction rehearsals and to resolve financial problems in particular cases. To study the case and demonstrate the actual application of this method, drug chain modeling at the tactical level was investigated. The physical and financial flow and their disturbance are simultaneously modulated. In order to complete the financial flow, financial ratios are also entered into the model. Problem uncertainty has been modeled using one of the most recent robust optimization approaches called Robust Possibilistic Programming (RPP) in combination with real options theory. The model was applied to a case study and its results were analyzed and validated by GAMS software. The results show that without violating the limitations of the problem, it shows appropriate decisions to deal with the problem.

Page 1 from 1     

مجله انجمن ایرانی تحقیق در عملیات Iranian Journal of Operations Research
Persian site map - English site map - Created in 0.05 seconds with 28 queries by YEKTAWEB 4219