The real option management of commodity conversion assets gives rise to intractable Markov decision pro-cesses (MDPs). This intractability is due primarily to the high dimensionality of a commodity forward curve, which is part of the MDP state when using high dimensional models of the evolution of this curve, as commonly done in practice. Focusing on commodity storage, we develop a novel approximate dynamic programming approach to obtain value function approximations from tractable relaxations of approximate linear programs (ALPs). We derive performance bounds that provide theoretical support for the use of some of these ALP relaxations rather than their respective ALPs. We estimate lower bounds and dual upper bounds on the value of an opti...
Abstract—We prove convergence of an approximate dynamic programming algorithm for a class of high-di...
This master thesis will demonstrate how to price perpetual American options with linear programming....
We propose a method of approximate dynamic programming for Markov decision processes (MDPs) using al...
<p>We study the merchant operations of commodity and energy conversion assets. Examples of such asse...
The valuation of the real option to store natural gas is a practically important problem that entail...
The real option management of commodity storage assets is an important practical problem. Practition...
The real option management of commodity storage assets is an important practical problem. Practition...
Control decisions for gas storage facilities are made in the face of extreme uncertainty over future...
Sequential decision making under uncertainty is at the heart of a wide variety of practical problems...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Resea...
A renewable power producer who trades on a day-ahead market sells electricity under supply and price...
We consider large-scale Markov decision pro-cesses (MDPs) with parameter uncertainty, un-der the rob...
In this work we address investment decisions using real options. A standard numerical approach for v...
We consider the problem of finding profit-maximising prices for delivery time slots in the context o...
We introduce a new algorithm based on linear programming for optimization of average-cost Markov dec...
Abstract—We prove convergence of an approximate dynamic programming algorithm for a class of high-di...
This master thesis will demonstrate how to price perpetual American options with linear programming....
We propose a method of approximate dynamic programming for Markov decision processes (MDPs) using al...
<p>We study the merchant operations of commodity and energy conversion assets. Examples of such asse...
The valuation of the real option to store natural gas is a practically important problem that entail...
The real option management of commodity storage assets is an important practical problem. Practition...
The real option management of commodity storage assets is an important practical problem. Practition...
Control decisions for gas storage facilities are made in the face of extreme uncertainty over future...
Sequential decision making under uncertainty is at the heart of a wide variety of practical problems...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Resea...
A renewable power producer who trades on a day-ahead market sells electricity under supply and price...
We consider large-scale Markov decision pro-cesses (MDPs) with parameter uncertainty, un-der the rob...
In this work we address investment decisions using real options. A standard numerical approach for v...
We consider the problem of finding profit-maximising prices for delivery time slots in the context o...
We introduce a new algorithm based on linear programming for optimization of average-cost Markov dec...
Abstract—We prove convergence of an approximate dynamic programming algorithm for a class of high-di...
This master thesis will demonstrate how to price perpetual American options with linear programming....
We propose a method of approximate dynamic programming for Markov decision processes (MDPs) using al...