Addressing supply-side risk in uncertain power markets: stochastic Nash models, scalable algorithms and error analysis

被引:38
|
作者
Kannan, Aswin [1 ]
Shanbhag, Uday V. [2 ]
Kim, Harrison M. [2 ]
机构
[1] Argonne Natl Lab, Div Math & Comp Sci, Urbana, IL 61801 USA
[2] Univ Illinois, Dept Ind & Enterprise Syst Engn, Urbana, IL USA
来源
OPTIMIZATION METHODS & SOFTWARE | 2013年 / 28卷 / 05期
基金
美国国家科学基金会;
关键词
variational inequalities; stochastic programming; Nash games; projected gradient schemes; cutting plane methods; S-ADAPTED EQUILIBRIA; ELECTRICITY MARKETS; GAMES; PROGRAMS; SYSTEMS;
D O I
10.1080/10556788.2012.676756
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Increasing penetration of volatile wind-based generation into the fuel mix is leading to growing supply-side volatility. As a consequence, the reliability of the power grid continues to be a source of much concern, particularly since the impact of supply-side risk exposure, arising from aggressive bidding,(1) is not felt by risk-seeking generation firms; instead, the system operator is largely responsible for managing shortfalls in the real-time market. We propose an alternate design in which the cost of such risk is transferred to firms responsible for imposing such risk. The resulting strategic problem can be cast as a two-period generalized stochastic Nash game with shared strategy sets. A subset of equilibria is given by a solution to a related stochastic variational inequality, that is shown to be both monotone and solvable. Computing solutions of this variational problem is challenging since the size of the problem grows with the cardinality of the sample space, network size and the number of participating firms. Consequently, direct schemes are inadvisable for most practical problems. Instead, we present a distributed regularized primal-dual scheme and a dual projection scheme where both primal and dual iterates are computed separately. Rates of convergence estimates are provided and error bounds are developed for inexact extensions of the dual scheme. Unlike projection schemes for deterministic problems, here the projection step requires the solution of a possibly massive stochastic programme. By utilizing cutting plane methods, we ensure that the complexity of the projection scheme scales slowly with the size of the sample space. We conclude with a study of a 53-node electricity network that allows for deriving insights regarding market design and operation, particularly for accommodating firms with uncertain generation assets.
引用
收藏
页码:1095 / 1138
页数:44
相关论文
empty
未找到相关数据