Search

Securing profits from energy, reserve capacity and balancing markets is critical to ensure the profitability of battery energy systems (BES). However, the intimate connection between offers on these trading floors combined with the limited energy storage capacity of BES renders its scheduling very complex. In this paper, we develop a bilevel optimization problem for strategic participation of a BES in the day-ahead energy-reserve and balancing markets, improving the state-of-the-art by (i) considering the conditional-value-at-risk; (ii) ensuring the real-time feasibility of the obtained day-ahead schedule; (iii) addressing the operational underperformance risk stemming from inaccurate battery modeling. In a case study, we illustrate how the proposed model allows risk-averse BES owners to hedge their day-ahead position without jeopardizing their expected profit, while ensuring the feasibility of their day-ahead schedule. [ABSTRACT FROM AUTHOR]

The first of this two-paper series addresses a practical day-ahead auction model, where generation revenue constraints are explicitly incorporated in the problem formulation, as routinely done in several national electricity markets across Europe. The revenue-constrained market-clearing procedure includes the effect of the transmission network, inter-temporal constraints associated with generation scheduling, demand-side bidding, and marginal pricing. This auction design is an instance of price-based market clearing which features two major complicating factors. First, locational marginal prices become decision variables of the optimization process. In addition, producer revenues are formulated as bilinear and highly nonconvex products of power outputs and market-clearing prices. The resulting problem is formulated as a mixed-integer nonlinear bilevel program with bilinear terms for which available solution techniques rely on heuristics, approximations, or modeling simplifications. This paper presents a novel and exact methodology whereby the original problem is recast as an equivalent single-level mixed-integer linear program. As a consequence, finite convergence to optimality is guaranteed and the use of standard commercial software is allowed. The proposed transformation is based on duality theory of linear programming, Karush-Kuhn-Tucker optimality conditions, and integer algebra results. In the second part of this two-paper series, numerical results from several case studies illustrate the effective performance of the proposed solution approach. [ABSTRACT FROM AUTHOR]