RT Journal Article
JF 2014 47th Hawaii International Conference on System Sciences
YR 2003
VO 02
SP 53c
TI Designs for Ramp-Constrained Day-Ahead Auctions
A1 Andrew M. Ross,
A1 Shmuel S. Oren,
K1 null
AB Some electric power markets allow bidders to specify constraints on ramp rates for increasing or decreasing power production. We show in a small example that a bidder could use an overly restrictive constraint to increase profits, and explore the cause by visualizing the feasible region from the linear program corresponding to the power auction. We propose two penalty approaches to discourage bidders from such a tactic: one based on duality theory of Linear Programming, the other based on social cost differences caused by ramp constraints. We evaluate the two approaches using a simplified scaled model of the California power system, with actual 2001 California demand data.
PB IEEE Computer Society, [URL:http://www.computer.org]
LA English
DO 10.1109/HICSS.2003.1173862
LK http://doi.ieeecomputersociety.org/10.1109/HICSS.2003.1173862