Bilevel optimization applied to strategic pricing in competitive electricity markets

被引:3
作者
Fampa, M. [1 ]
Barroso, L. A. [2 ]
Candal, D. [2 ]
Simonetti, L. [2 ]
机构
[1] Univ Fed Rio de Janeiro, Inst Matemat DCC & COPPE, BR-21945970 Rio De Janeiro, Brazil
[2] Univ Fed Rio de Janeiro, OPPE, BR-21945970 Rio De Janeiro, Brazil
基金
英国科研创新办公室;
关键词
electricity pool market; strategic pricing; bilevel programming; mathematical program with equilibrium constraints;
D O I
10.1007/s10589-007-9066-4
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we present a bilevel programming formulation for the problem of strategic bidding under uncertainty in a wholesale energy market (WEM), where the economic remuneration of each generator depends on the ability of its own management to submit price and quantity bids. The leader of the bilevel problem consists of one among a group of competing generators and the follower is the electric system operator. The capability of the agent represented by the leader to affect the market price is considered by the model. We propose two solution approaches for this non-convex problem. The first one is a heuristic procedure whose efficiency is confirmed through comparisons with the optimal solutions for some instances of the problem. These optimal solutions are obtained by the second approach proposed, which consists of a mixed integer reformulation of the bilevel model. The heuristic proposed is also compared to standard solvers for nonlinearly constrained optimization problems. The application of the procedures is illustrated in case studies with configurations derived from the Brazilian power system.
引用
收藏
页码:121 / 142
页数:22
相关论文
共 35 条
[1]   Concavity cuts for disjoint bilinear programming [J].
Alarie, S ;
Audet, C ;
Jaurnard, B ;
Savard, G .
MATHEMATICAL PROGRAMMING, 2001, 90 (02) :373-398
[2]   A SOLUTION METHOD FOR THE LINEAR STATIC STACKELBERG PROBLEM USING PENALTY-FUNCTIONS [J].
ANANDALINGAM, G ;
WHITE, DJ .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1990, 35 (10) :1170-1173
[3]  
[Anonymous], 2001, SOC ESTAD STICA INVE
[4]  
[Anonymous], THESIS ECOLE POLYTEC
[5]  
[Anonymous], NEOS GUIDE
[6]   A symmetrical linear maxmin approach to disjoint bilinear programming [J].
Audet, C ;
Hansen, P ;
Jaumard, B ;
Savard, G .
MATHEMATICAL PROGRAMMING, 1999, 85 (03) :573-592
[7]   Links between linear bilevel and mixed 0-1 programming problems [J].
Audet, C ;
Hansen, P ;
Jaumard, B ;
Savard, G .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1997, 93 (02) :273-300
[8]   A branch and cut algorithm for nonconvex quadratically constrained quadratic programming [J].
Audet, C ;
Hansen, P ;
Jaumard, B ;
Savard, G .
MATHEMATICAL PROGRAMMING, 2000, 87 (01) :131-152
[9]   Optimal offering strategies for generation companies operating in electricity spot markets [J].
Baillo, A ;
Ventosa, M ;
Rivier, M ;
Ramos, A .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2004, 19 (02) :745-753
[10]   Market power issues in bid-based hydrothermal dispatch [J].
Barroso, LAN ;
Fampa, MHC ;
Kelman, R ;
Pereira, MVF ;
Lino, P .
ANNALS OF OPERATIONS RESEARCH, 2002, 117 (1-4) :247-270