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

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

Journal: :Computers & Chemical Engineering 2004
Vicente Rico-Ramírez Urmila M. Diwekar

Optimal control problems involve the difficult task of determining time-varying profiles through dynamic optimization. Such problems become even more complex in practical situations where handling time dependent uncertainties becomes an important issue. Approaches to stochastic optimal control problems have been reported in the finance literature and are based on real option theory, combining I...

Journal: :Comput. Manag. Science 2016
Yonghan Feng Sarah M. Ryan

A two-stage stochastic program is formulated for day-ahead commitment of thermal generating units to minimize total expected cost considering uncertainties in the day-ahead load and the availability of variable generation resources. Commitments of thermal units in the stochastic reliability unit commitment (SRUC) are viewed as first-stage decisions, and dispatch is relegated to the second stage...

Journal: :European Journal of Operational Research 2012
Santiago Cerisola Jesús M. Latorre Andrés Ramos

In this paper we apply stochastic dual dynamic programming decomposition to a nonconvex multistage stochastic hydrothermal model where the nonlinear water head effects on production and the nonlinear dependence between the reservoir head and the reservoir volume are modeled. The nonconvex constraints that represent the production function of a hydro plant are approximated by McCormick envelopes...

Journal: :Annals OR 1998
Giorgio Consigli Michael A. H. Dempster

Multistage stochastic programming in contrast to stochastic control has found wide application in the formulation and solution of nancial problems characterized by a large number of state variables and a generally low n umber of possible decision stages. The literature on the use of multistage recourse modelling to formalize complex portfolio optimization problems dates back to the early sevent...

Journal: :Math. Meth. of OR 2000
Ger Koole

In this paper we apply a new framework for the study of monotonicity in queueing systems to stochastic scheduling models. This allows us a unified treatment of many different models, among which are multiple and single server models (with and without feedback), discrete and continuous time models, models with controlled and uncontrolled arrivals, etc.

2004
MARC C. STEINBACH

Unnecessarily conservative behavior of standard process control techniques can be avoided by stochastic programming models when the distribution of random distur­ bances is known. In an earlier study we have investigated such an approach for tank level constraints of a distillation process. Here we address techniques that have accelerated the numerical solution of the large and expensive stocha...

2016
MARTIN L. PUTERMAN

The Wiley-Interscience Paperback Series consists of selected books that have been made more accessible to consumers in an effort to increase global appeal and general circulation. With these new unabridged softcover...

This study addresses a stochastic structure for generation companies (GenCoʼs) that participate in hydro-thermal self-scheduling with a wind power plant on short-term scheduling for simultaneous reserve energy and energy market. In stochastic scheduling of HTSS with a wind power plant, in addition to various types of uncertainties such as energy price, spinning /non-spinning reserve prices, unc...

2016
Jiang Wu Fucheng Liao Jiamei Deng

This paper discusses the optimal preview control problem for a class of linear continuous stochastic control systems in the infinite horizon, based on the augmented error system method. Firstly, an assistant system is designed and the state equation is translated to the assistant system.Then, an integrator is introduced to construct a stochastic augmented error system. As a result, the tracking...

2002
M. N. El Agizy

A wide class of single-product, dynamic inventory problems with convex cost functions and a finite horizon is investigated as a stochastic programming problem. When demands have finite discrete distribution functions, we show that the problem can be substantially reduced in size to a linear program with upper-bounded variables. Moreover,, we show that the reduced problem has a network represent...

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

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