Abstract
Daily bidding is an activity of paramount importance for generation companies operating in dayahead electricity markets. The authors have developed a strategic bidding procedure based on stochastic programming to obtain optimal bids. In this paper, this large-scale mathematical programming problem is solved under the Benders and Lagrangian relaxation frameworks to determine the adequacy of these techniques to solve the optimal bidding problem. Numerical examples illustrate the conclusions of this research.
Bidding in a Day-Ahead Electricity Market: A Comparison of Decomposition Techniques
