This paper provides a technique based on stochastic programming to optimally solve the electricity procurement problem faced by a large consumer. Supply sources include bilateral contracts, a limited amount of self-production and the pool. Risk aversion is explicitly modeled using the conditional value-at-risk methodology. Results from a realistic case study are provided and analyzed
We discuss a stochastic-programming-based method for scheduling electric power generation subject to uncertainty. Such uncertainty may arise from either imperfect forecasting or moment-to-moment fluctuations, and on either the supply or the demand side. The method gives a system of locational marginal prices that reflect the uncertainty, and these may be used in a market settlement scheme in which payment is for energy only. We show that this scheme is revenue adequate in expectation.
1 February 2015 in Mathematics of Operations Research
We prove the almost-sure convergence of a class of sampling-based nested decomposition algorithms for multistage stochastic convex programs in which the stage costs are general convex functions of the decisions and uncertainty is modelled by a scenario tree. As special cases, our results imply the almost-sure convergence of stochastic dual dynamic programming, cutting-plane and partial-sampling (CUPPS) algorithm, and dynamic outer-approximation sampling algorithms when applied to problems with general convex cost functions.
We consider a class of multistage stochastic linear programs in which at each stage a coherent risk measure of future costs is to be minimized. A general computational approach based on dynamic programming is derived that can be shown to converge to an optimal policy. By computing an inner approximation to future cost functions, we can evaluate an upper bound on the cost of an optimal policy, and an outer approximation delivers a lower bound. The approach we describe is particularly useful in sampling-based algorithms, and a numerical example is provided to show the efficacy of the methodology when used in conjunction with stochastic dual dynamic programming.