CALENDRIER

mai 2018
L M M J V S D
  01 02 03 04 05 06
07 08 09 10 11 12 13
14 15 16 17 18 19 20
21 22 23 24 25 26 27
28 29 30 31      

Partager cet événement

Enregistrer cet événement

Séminaire : Revenue and network-constrained day-ahead market clearing under marginal pricing

Date
Jeudi 12 avril 2018
Débute à 15:30

Prix
gratuit

Contact
Marilyne Lavoie
Site Web

Lieu
4488
2920, chemin de la Tour
Montréal, QC Canada
H3T 1N8

514 343-6111
Site Web | Itinéraire et carte

Catégories


Consulté 518 fois
Séminaire : Revenue and network-constrained day-ahead market clearing under marginal pricing

Séminaire du GERAD conjoint avec la Chaire de recherche industrielle CRSNG-Hydro-Québec-Schneider Electric en optimisation des réseaux électriques intelligents

Titre :
Revenue and network-constrained day-ahead market clearing under marginal pricing

Conférencier : Natalia Alguacil – Universidad de Castilla-La Mancha, Espagne

In this seminar a practical day-ahead auction model, where generation revenue constraints are explicitly incorporated in the problem formulation, will be presented. 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 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 work shows 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.

Do not forget to confirm your attendance: https://doodle.com/poll/ckawe39kkccwq6yk

© École Polytechnique de Montréal
Bottin | Plan du site | Recherche | Conditions | Besoin d'aide?