نتایج جستجو برای: dynamic programming

تعداد نتایج: 697441  

Journal: :Journal of Mathematical Analysis and Applications 1975

Journal: :journal of optimization in industrial engineering 2016
mohammad saber fallah nezhad abolghasem yousefi babadi

acceptance sampling models have been widely applied in companies for the inspection and testing the raw material as well as the final products. a number of lots of the items are produced in a day in the industries so it may be impossible to inspect/test each item in a lot. the acceptance sampling models only provide the guarantee for the producer and consumer that the items in the lots are acco...

Journal: :اقتصاد و توسعه کشاورزی 0
مهرداد باقری عبدالکریم اسماعیلی منصور زیبایی

this study develops a long run optimal pattern for nomadic ranchers of fars province under climate uncertainty by simulating dynamic process of livestock and forage productivity as well as employing dynamic stochastic programming. results indicate that the nomadic representatives do not perform, optimally. despite their attachments to livestock as an asset, and their life dependency on livestoc...

We present a stochastic dynamic programming approach with Markov chains for optimal control of the forest sector. The forest is managed via continuous cover forestry and the complete system is sustainable. Forest industry production, logistic solutions and harvest levels are optimized based on the sequentially revealed states of the markets. Adaptive full system optimization is necessary for co...

S. H. Mirmohammadi, S. Khosravi,

Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by  many researchers. Considering the quantity discount in  purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In  this paper, stochastic dyn...

Journal: :journal of industrial engineering, international 2006
e jahangiri f ghassemi-tari

nonlinear knapsack problems (nkp) are the alternative formulation for the multiple-choice knapsack problems. a powerful approach for solving nkp is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...

Journal: :IFAC Proceedings Volumes 1996

Journal: :International Journal of Robust and Nonlinear Control 2010

Journal: :Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics 1977

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید