Many industries use dynamic pricing on an operational level to maximize revenue from selling a fixed capacity over a finite horizon. Classical risk-neutral approaches do not accommodate the risk aversion often encountered in practice. We add to the scarce literature on risk aversion by...

Binary random variables often refer to such as customers that are present or not, roads that are open or not, machines that are operable or not. At the same time, stochastic programs often apply to situations where penalties are accumulated when demand is not met, travel times are too long, or...

In this paper, we treat an optimal control problem of a stochastic two-machine flowshop with machines subject to random breakdown and repair. While the problem is difficult to solve, it can be approximated by a deterministic problem when the rates of machine failure and repair become large....

In this paper, we develop a rigorous new framework for the concepts of forecast and decision horizons. These concepts are conditional in nature and, in turn, enable us to unify the existing concepts of “strong” and “weak” horizons. Moreover, we are able to precisely state the question of...

We consider the basic problem of refi tting a time series over a finite period of time and formulate it as a stochastic dynamic program. By changing the underlying Markov decision process we are able to obtain a model that at optimality considers historical data as well as forecasts of future...

This paper provides a concise guide to dynamic optimization with an integral treatment on various optimal control and dynamic programming problems. It presents essential theorems and methods for obtaining and characterizing solutions to these problems. The paper discusses Pontryagin's maximum...

In this contribution we propose a dynamic tracking error problem and we consider the problem of monitoring at discrete point the shortfall of the portfolio below a set of given reference levels of wealth. We formulate and solve the resulting dynamic optimization problem using stochastic...

In this contribution we propose an approach to solve a multistage stochastic programming problem which allows us to obtain a time and nodal decomposition of the original problem. This double decomposition is achieved applying a discrete time optimal control formulation to the original stochastic...

This paper derives a maximum principle for dynamic systems with continuous lags, i.e., systems governed by integrodifferential equations, using dynamic programming. As a result, the adjoint variables can be provided with useful economic interpretations

Economists who want to numerically approximate an elaborate dynamic stochastic programming problem (DSPP), either for structural estimation or policy evaluation purposes, are often confined by the curse of dimensionality: richer models with various state and control variables cannot be solved on...