On Clearing Coupled Day-Ahead Electricity Markets
|
|
- Margaret Murphy
- 6 years ago
- Views:
Transcription
1 On Clearing Coupled Day-Ahead Electricity Markets Johannes C. Müller joint work with Alexander Martin Sebastian Pokutta Oct 2010 Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
2 1 Electricity Markets 2 Mixed Integer Quadratic Programm Maximization of the Economic Surplus Optimality Conditions Block Price Condition 3 Algorithms Fast Heuristic Exact Algorithm 4 Results Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
3 Day-Ahead Electricity Auctions Day-Ahead Auction 1. collect demand and supply orders for the following day 2. start auction maximize economic surplus accept/reject orders find clearing price 3. return execution schedule for the following day Infrastructure Market Areas Interconnectors Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
4 Day-Ahead Electricity Auctions Day-Ahead Auction 1. collect demand and supply orders for the following day 2. start auction maximize economic surplus accept/reject orders find clearing price 3. return execution schedule for the following day Infrastructure Market Areas Interconnectors Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
5 Basic elements of energy markets Bids / Orders are characterized by quantity (demand/supply, area, hour) price limit allow partial execution (yes/no) Order Types Hourly Bids Block Bids Flexible Bids Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
6 Basic elements of energy markets Bids / Orders are characterized by quantity (demand/supply, area, hour) price limit allow partial execution (yes/no) Order Types Hourly Bids Block Bids Flexible Bids Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
7 Hourly Bids Aggregation of hourly bid curves provides one hourly net curve per area and hour bid curve trading quantities depending on the price downward sloping curves Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
8 Block Bids Quantity Time Slot Block executed Block not executed A block bid allows for trading electricity in several hours using only one price limit for all hours: (net gain) < 0 don t execute Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
9 Flexible Bids Price, /MW System Price Flex Bid Price Limit Supply Flex Bid can be executed Time Slot Flexible bids allow for trading electricity without defining the delivery hour using a limit price to avoid a loss (gain in hour t) < 0 don t execute in hour t Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
10 Interconnectors Function of Interconnectors balance net demand of adjacent areas NO4 harmonize prices NO5 NO3 SE FI NO1 NO2 EST Transmission Constraints Available Transmission Capacity (ATC): limits the flow Ramp Rate: limits the change of flow FR BE NL DKA SEA DK1 DK2 GER Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
11 Interconnectors Function of Interconnectors balance net demand of adjacent areas NO4 harmonize prices NO5 NO3 SE FI NO1 NO2 EST Transmission Constraints Available Transmission Capacity (ATC): limits the flow Ramp Rate: limits the change of flow FR BE NL DKA SEA DK1 DK2 GER Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
12 Maximization of the Economic Surplus, subject to Transmission Constraints: Overview δh max q h p h (u) du + p b q b,t β b + K h H 0 s.t. a A, t T : b B,t T q h δ h + q b,t β b = h H a,t b B a c C a (MIQP) τ c,t c C + a τ c,t c C, t T : τ c,t τ c,t τ c,t c C, t T : τ c τ c,t τ c,t 1 τ c c C, t T : τ c,t R h H : δ h [0, 1] b B : β b {0, 1} Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
13 Mixed Integer Quadratic Programm Objective: Economic Surplus max δh q h p h (u) du + p b q b,t β b + K h H 0 b B,t T Notation: β b {0, 1} p b, q b,t δ h [0, 1] p h (u) execution state of block bid b B price limit; net demand of block b B in hour t T execution state of hourly net curve segment h H parametrization of the price of curve segment h H Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
14 Mixed Integer Quadratic Programm Constraints: 1. net demand = net import: a A, t T q h δ h + q b,t β b = h H a,t b B a c C a τ c,t c C + a τ c,t 2. ATC: c C, t T τ c,t τ c,t τ c,t 3. ramp rate: c C, t T τ c τ c,t τ c,t 1 τ c Notation: τ c,t R transmission on connector c C, hour t T h H a,t net curve segments in area a A, hour t T b B a block bids in area a c C + a connectors leaving area a Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
15 Mixed Integer Quadratic Programm Constraints: 1. net demand = net import: a A, t T q h δ h + q b,t β b = h H a,t b B a c C a τ c,t c C + a τ c,t 2. ATC: c C, t T τ c,t τ c,t τ c,t 3. ramp rate: c C, t T τ c τ c,t τ c,t 1 τ c Notation: τ c,t R transmission on connector c C, hour t T h H a,t net curve segments in area a A, hour t T b B a block bids in area a c C + a connectors leaving area a Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
16 Mixed Integer Quadratic Programm Constraints: 1. net demand = net import: a A, t T q h δ h + q b,t β b = h H a,t b B a c C a τ c,t c C + a τ c,t 2. ATC: c C, t T τ c,t τ c,t τ c,t 3. ramp rate: c C, t T τ c τ c,t τ c,t 1 τ c Notation: τ c,t R transmission on connector c C, hour t T h H a,t net curve segments in area a A, hour t T b B a block bids in area a c C + a connectors leaving area a Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
17 Optimality Conditions Optimal solution to (MIQP) can be computed with MIQP solvers (e.g. IBM CPLEX 12.1) Analyze optimal solution: fix the combinatorial bid selection apply Karush-Kuhn-Tucker-Condition for QPs (cf. [1]) obtain dual variables, also called shadow prices Shadow Prices π to (MIQP) satisfy (cf. [3]) Filling Condition Flow Price Condition Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
18 Optimality Conditions Optimal solution to (MIQP) can be computed with MIQP solvers (e.g. IBM CPLEX 12.1) Analyze optimal solution: fix the combinatorial bid selection apply Karush-Kuhn-Tucker-Condition for QPs (cf. [1]) obtain dual variables, also called shadow prices Shadow Prices π to (MIQP) satisfy (cf. [3]) Filling Condition Flow Price Condition Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
19 Filling Condition MW δ = 0 1 δ = 1 2 price / MW Filling Condition Price change is linear in the partial execution of the active segment: Filling condition is satisfied, if for all segments h H a,t in area a, hour t p h (δ h ), if δ h = 1 π a,t = p h (δ h ), if δ h (0, 1). p h (δ h ), if δ h = 0 (1) Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
20 Flow Price Condition Simplified Flow Price Condition For adjacent areas it holds: Prices deviate a transmission constraint is active. No active transmission constraint prices coincide. (π, τ) satisfies simplified flow price condition, if for all connectors c = (r, s), hours t π r,t π s,t τ c,t {τ c,t, τ c,t } active ATC τ c,t τ c,t 1 = τ c active ramping [ τ c,t τ c,t+1 = τ c ] active ramping. Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
21 Block Price Condition Block can be executed, if it does not incur a loss. a A, b B a : β b = 1 Notation: (p b π a,t ) q b,t 0. t T π a,t β b p b, q b,t price in area a, time t execution state of block b B a in area a price limit; net demand in hour t T Optimal Solution to (MIQP) For an optimal bid selection β of (MIQP) the existence of shadow prices that satisfy all block price conditions is not given. Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
22 Block Price Condition Block can be executed, if it does not incur a loss. a A, b B a : β b = 1 Notation: (p b π a,t ) q b,t 0. t T π a,t β b p b, q b,t price in area a, time t execution state of block b B a in area a price limit; net demand in hour t T Optimal Solution to (MIQP) For an optimal bid selection β of (MIQP) the existence of shadow prices that satisfy all block price conditions is not given. Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
23 Infeasibility Cut: Bid Cut Given: bid selection β Assume: no shadow prices exist, satisfying all block price conditions. Define the following cut: Bid Cut L: executed blocks incurring a loss at prices π. L = {b B β b = 1 and (p b πa,t)q b,t < 0}, t T Cut(L): prohibits execution of at least one bid of L. Cut(L) : β b L 1. b L Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
24 Infeasibility Cut: Bid Cut Given: bid selection β Assume: no shadow prices exist, satisfying all block price conditions. Define the following cut: Bid Cut L: executed blocks incurring a loss at prices π. L = {b B β b = 1 and (p b πa,t)q b,t < 0}, t T Cut(L): prohibits execution of at least one bid of L. Cut(L) : β b L 1. b L Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
25 Bid Cut Heuristic Algorithm: 1. (β, δ, τ ) Solve (MIQP). 2. (π, L) Find shadow prices for (β, δ, τ ). 3. if L > 0, then 4. Add Cut(L) to the model (MIQP). 5. Go to step end if Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
26 Bid Cut Heuristic Algorithm: 1. (β, δ, τ ) Solve (MIQP). 2. (π, L) Find shadow prices for (β, δ, τ ). 3. if L > 0, then 4. Add Cut(L) to the model (MIQP). 5. Go to step end if Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
27 Bid Cut Heuristic Algorithm: 1. (β, δ, τ ) Solve (MIQP). 2. (π, L) Find shadow prices for (β, δ, τ ). 3. if L > 0, then 4. Add Cut(L) to the model (MIQP). 5. Go to step end if Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
28 Bid Cut Heuristic, Discussion (+) Fast Algorithm (4 seconds for 10 market areas) (+) Good Relative Gap ( ) (o) Bid Cut slightly to strong (o) Not Optimal in pathological cases (4% of the cases) Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
29 Branch-and-Cut Decomposition Replace Bid Cut by a less restrictive Cut: Exact Bid Cut (cf. [2]) Exclude only one infeasible bid selection β : Cut(β ) : β b + (1 β b ) 1 b B:β b =0 b B:β b =1 Improved version: Branching over the Bid Cut Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
30 Branch-and-Cut Decomposition Replace Bid Cut by a less restrictive Cut: Exact Bid Cut (cf. [2]) Exclude only one infeasible bid selection β : Cut(β ) : β b + (1 β b ) 1 b B:β b =0 b B:β b =1 Improved version: Branching over the Bid Cut Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
31 Branch-and-Cut Decomposition, Discussion (+) Optimal Algorithm (+) Good Relative Gap ( ) (o) Slight improvement of Relative Gap ( ) ( ) Exact Bid Cut not strong enough ( ) Slow ( 10 minutes in 62% of the cases) Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
32 Results 79 realistic test cases: 10 market areas, ca. 600 blocks, ca curve segments Algorithm Optimal Bid Relative Computing Selection Gap Time Bid Cut Heuristic 38% 1.926E sec B&C Decomposition 38% 1.924E-6 10 min Optimal bid selection: relative gap within 10 minutes Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
33 Thank you for your attention! Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance / 22
34 References References [1] BOYD, Stephen ; VANDENBERGHE, Lieven: Convex Optimization. Cambridge University Press, ISBN [2] CHU, Y. ; XIA, Q.: Generating Benders cuts for a general class of integer programming problems. In: Lecture Notes in Computer Science 3011, CPAIOR 2004, edited by J.-C. Régin and M. Rueher (2004), S [3] MÜLLER, Johannes C.: Optimierungsmethoden für die Kopplung von Day-Ahead-Strommärkten, TU-Darmstadt, Diplomarbeit, November 2009 Johannes C. Müller Clearing Coupled Day-Ahead Electricity Markets Energy Finance 2010
A new primal-dual framework for European day-ahead electricity auctions
A new primal-dual framework for European day-ahead electricity auctions Mehdi Madani*, Mathieu Van Vyve** *Louvain School of management, ** CORE Catholic University of Louvain Mathematical Models and Methods
More informationMotivation. Lecture 2 Topics from Optimization and Duality. network utility maximization (NUM) problem:
CDS270 Maryam Fazel Lecture 2 Topics from Optimization and Duality Motivation network utility maximization (NUM) problem: consider a network with S sources (users), each sending one flow at rate x s, through
More informationEUROPEAN EXPERIENCE: Large-scale cross-country forecasting with the help of Ensemble Forecasts
WEPROG Weather & wind Energy PROGnoses EUROPEAN EXPERIENCE: Large-scale cross-country forecasting with the help of Ensemble Forecasts Session 6: Integrating forecasting into market operation, the EMS and
More informationOptimization Basics for Electric Power Markets
Optimization Basics for Electric Power Markets Presenter: Leigh Tesfatsion Professor of Econ, Math, and ECpE Iowa State University Ames, Iowa 50011-1070 http://www.econ.iastate.edu/tesfatsi/ tesfatsi@iastate.edu
More informationSHORT-TERM hydropower planning under uncertainty is
Proceedings of the International MultiConference of Engineers and Computer Scientists 015 Vol II, IMECS 015, March 18-0, 015, Hong Kong Hydropower Producer Day-ahead Market Strategic Offering Using Stochastic
More informationA three-level MILP model for generation and transmission expansion planning
A three-level MILP model for generation and transmission expansion planning David Pozo Cámara (UCLM) Enzo E. Sauma Santís (PUC) Javier Contreras Sanz (UCLM) Contents 1. Introduction 2. Aims and contributions
More informationReview of Optimization Basics
Review of Optimization Basics. Introduction Electricity markets throughout the US are said to have a two-settlement structure. The reason for this is that the structure includes two different markets:
More informationAnalysis of Adaptive Certainty-Equivalent Techniques for the Stochastic Unit Commitment Problem
power systems eehlaboratory José Sebastián Espejo-Uribe Analysis of Adaptive Certainty-Equivalent Techniques for the Stochastic Unit Commitment Problem Master Thesis PSL177 EEH Power Systems Laboratory
More informationConstrained Optimization and Lagrangian Duality
CIS 520: Machine Learning Oct 02, 2017 Constrained Optimization and Lagrangian Duality Lecturer: Shivani Agarwal Disclaimer: These notes are designed to be a supplement to the lecture. They may or may
More informationTutorial 2: Modelling Transmission
Tutorial 2: Modelling Transmission In our previous example the load and generation were at the same bus. In this tutorial we will see how to model the transmission of power from one bus to another. The
More informationFirms and returns to scale -1- Firms and returns to scale
Firms and returns to scale -1- Firms and returns to scale. Increasing returns to scale and monopoly pricing 2. Constant returns to scale 19 C. The CRS economy 25 D. pplication to trade 47 E. Decreasing
More informationPerfect and Imperfect Competition in Electricity Markets
Perfect and Imperfect Competition in Electricity Marets DTU CEE Summer School 2018 June 25-29, 2018 Contact: Vladimir Dvorin (vladvo@eletro.dtu.d) Jalal Kazempour (seyaz@eletro.dtu.d) Deadline: August
More informationMEDIUM-TERM HYDROPOWER SCHEDULING BY STOCHASTIC DUAL DYNAMIC INTEGER PROGRAMMING: A CASE STUDY
MEDIUM-TERM HYDROPOWER SCHEDULING BY STOCHASTIC DUAL DYNAMIC INTEGER PROGRAMMING: A CASE STUDY Martin Hjelmeland NTNU Norwegian University of Science and Technology, Trondheim, Norway. martin.hjelmeland@ntnu.no
More informationOPTIMIZATION. joint course with. Ottimizzazione Discreta and Complementi di R.O. Edoardo Amaldi. DEIB Politecnico di Milano
OPTIMIZATION joint course with Ottimizzazione Discreta and Complementi di R.O. Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-15-16.shtml
More informationFirms and returns to scale -1- John Riley
Firms and returns to scale -1- John Riley Firms and returns to scale. Increasing returns to scale and monopoly pricing 2. Natural monopoly 1 C. Constant returns to scale 21 D. The CRS economy 26 E. pplication
More informationTransmission capacity allocation in zonal electricity markets
Transmission capacity allocation in zonal electricity markets Anthony Papavasiliou (UC Louvain) Collaborators: Ignacio Aravena (LLNL), Yves Smeers (UC Louvain) Workshop on Flexible Operation and Advanced
More informationStoring energy or Storing Consumption?
Storing energy or Storing Consumption? It is not the same! Joachim Geske, Richard Green, Qixin Chen, Yi Wang 40th IAEE International Conference 18-21 June 2017, Singapore Motivation Electricity systems
More informationStochastic Unit Commitment with Topology Control Recourse for Renewables Integration
1 Stochastic Unit Commitment with Topology Control Recourse for Renewables Integration Jiaying Shi and Shmuel Oren University of California, Berkeley IPAM, January 2016 33% RPS - Cumulative expected VERs
More informationOptimization Tutorial 1. Basic Gradient Descent
E0 270 Machine Learning Jan 16, 2015 Optimization Tutorial 1 Basic Gradient Descent Lecture by Harikrishna Narasimhan Note: This tutorial shall assume background in elementary calculus and linear algebra.
More informationDual Decomposition.
1/34 Dual Decomposition http://bicmr.pku.edu.cn/~wenzw/opt-2017-fall.html Acknowledgement: this slides is based on Prof. Lieven Vandenberghes lecture notes Outline 2/34 1 Conjugate function 2 introduction:
More informationLagrange Duality. Daniel P. Palomar. Hong Kong University of Science and Technology (HKUST)
Lagrange Duality Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization Fall 2017-18, HKUST, Hong Kong Outline of Lecture Lagrangian Dual function Dual
More informationCMSC 858F: Algorithmic Game Theory Fall 2010 Market Clearing with Applications
CMSC 858F: Algorithmic Game Theory Fall 2010 Market Clearing with Applications Instructor: Mohammad T. Hajiaghayi Scribe: Rajesh Chitnis September 15, 2010 1 Overview We will look at MARKET CLEARING or
More informationLINEAR PROGRAMMING APPROACH FOR THE TRANSITION FROM MARKET-GENERATED HOURLY ENERGY PROGRAMS TO FEASIBLE POWER GENERATION SCHEDULES
LINEAR PROGRAMMING APPROACH FOR THE TRANSITION FROM MARKET-GENERATED HOURLY ENERGY PROGRAMS TO FEASIBLE POWER GENERATION SCHEDULES A. Borghetti, A. Lodi 2, S. Martello 2, M. Martignani 2, C.A. Nucci, A.
More information4. The Dual Simplex Method
4. The Dual Simplex Method Javier Larrosa Albert Oliveras Enric Rodríguez-Carbonell Problem Solving and Constraint Programming (RPAR) Session 4 p.1/34 Basic Idea (1) Algorithm as explained so far known
More informationThermal Unit Commitment Problem
Thermal Unit Commitment Problem Moshe Potsane, Luyanda Ndlovu, Simphiwe Simelane Christiana Obagbuwa, Jesal Kika, Nadine Padayachi, Luke O. Joel Lady Kokela, Michael Olusanya, Martins Arasomwa, Sunday
More informationIntroduction to Machine Learning Lecture 7. Mehryar Mohri Courant Institute and Google Research
Introduction to Machine Learning Lecture 7 Mehryar Mohri Courant Institute and Google Research mohri@cims.nyu.edu Convex Optimization Differentiation Definition: let f : X R N R be a differentiable function,
More informationMathematical Foundations -1- Constrained Optimization. Constrained Optimization. An intuitive approach 2. First Order Conditions (FOC) 7
Mathematical Foundations -- Constrained Optimization Constrained Optimization An intuitive approach First Order Conditions (FOC) 7 Constraint qualifications 9 Formal statement of the FOC for a maximum
More informationMixed Integer Linear Programming Formulation for Chance Constrained Mathematical Programs with Equilibrium Constraints
Mixed Integer Linear Programming Formulation for Chance Constrained Mathematical Programs with Equilibrium Constraints ayed A. adat and Lingling Fan University of outh Florida, email: linglingfan@usf.edu
More informationThe Tactical Berth Allocation Problem with Quay-Crane Assignment and Transshipment Quadratic Costs
The Tactical Berth Allocation Problem with Quay-Crane Assignment and Transshipment Quadratic Costs Models and Heuristics Ilaria Vacca Transport and Mobility Laboratory, EPFL joint work with Matteo Salani,
More informationECG 740 GENERATION SCHEDULING (UNIT COMMITMENT)
1 ECG 740 GENERATION SCHEDULING (UNIT COMMITMENT) 2 Unit Commitment Given a load profile, e.g., values of the load for each hour of a day. Given set of units available, When should each unit be started,
More informationAn Integrated Method for Planning and Scheduling to Minimize Tardiness
An Integrated Method for Planning and Scheduling to Minimize Tardiness J N Hooker Carnegie Mellon University john@hookerteppercmuedu Abstract We combine mixed integer linear programming (MILP) and constraint
More informationA Unified Framework for Defining and Measuring Flexibility in Power System
J A N 1 1, 2 0 1 6, A Unified Framework for Defining and Measuring Flexibility in Power System Optimization and Equilibrium in Energy Economics Workshop Jinye Zhao, Tongxin Zheng, Eugene Litvinov Outline
More information2018 Annual Review of Availability Assessment Hours
2018 Annual Review of Availability Assessment Hours Amber Motley Manager, Short Term Forecasting Clyde Loutan Principal, Renewable Energy Integration Karl Meeusen Senior Advisor, Infrastructure & Regulatory
More informationDynamic Network Utility Maximization
Dynamic Network Utility Maximization Nikolaos Trichakis Stephen Boyd Argyrios Zymnis Electrical Engineering Department, Stanford University IFAC 7/7/8 Network Utility Maximization maximize U(f) subject
More informationOn the Method of Lagrange Multipliers
On the Method of Lagrange Multipliers Reza Nasiri Mahalati November 6, 2016 Most of what is in this note is taken from the Convex Optimization book by Stephen Boyd and Lieven Vandenberghe. This should
More informationConvex Optimization Overview (cnt d)
Conve Optimization Overview (cnt d) Chuong B. Do November 29, 2009 During last week s section, we began our study of conve optimization, the study of mathematical optimization problems of the form, minimize
More informationConvex Optimization & Lagrange Duality
Convex Optimization & Lagrange Duality Chee Wei Tan CS 8292 : Advanced Topics in Convex Optimization and its Applications Fall 2010 Outline Convex optimization Optimality condition Lagrange duality KKT
More informationTradable Permits for System-Optimized Networks. Anna Nagurney Isenberg School of Management University of Massachusetts Amherst, MA 01003
Tradable Permits for System-Optimized Networks Anna Nagurney Isenberg School of Management University of Massachusetts Amherst, MA 01003 c 2002 Introduction In this lecture, I return to the policy mechanism
More informationDuality. Geoff Gordon & Ryan Tibshirani Optimization /
Duality Geoff Gordon & Ryan Tibshirani Optimization 10-725 / 36-725 1 Duality in linear programs Suppose we want to find lower bound on the optimal value in our convex problem, B min x C f(x) E.g., consider
More informationModelling wind power in unit commitment models
Modelling wind power in unit commitment models Grid integration session IEA Wind Task 25 Methodologies to estimate wind power impacts to power systems Juha Kiviluoma, Hannele Holttinen, VTT Technical Research
More informationMulti-Area Stochastic Unit Commitment for High Wind Penetration in a Transmission Constrained Network
Multi-Area Stochastic Unit Commitment for High Wind Penetration in a Transmission Constrained Network Anthony Papavasiliou Center for Operations Research and Econometrics Université catholique de Louvain,
More informationPractical Tips for Modelling Lot-Sizing and Scheduling Problems. Waldemar Kaczmarczyk
Decision Making in Manufacturing and Services Vol. 3 2009 No. 1 2 pp. 37 48 Practical Tips for Modelling Lot-Sizing and Scheduling Problems Waldemar Kaczmarczyk Abstract. This paper presents some important
More informationAppendix A Solving Systems of Nonlinear Equations
Appendix A Solving Systems of Nonlinear Equations Chapter 4 of this book describes and analyzes the power flow problem. In its ac version, this problem is a system of nonlinear equations. This appendix
More informationA Benders decomposition method for locating stations in a one-way electric car sharing system under demand uncertainty
A Benders decomposition method for locating stations in a one-way electric car sharing system under demand uncertainty Hatice Calik 1,2 and Bernard Fortz 1,3 1 Department of Computer Science, Université
More informationValue of Forecasts in Unit Commitment Problems
Tim Schulze, Andreas Grothery and School of Mathematics Agenda Motivation Unit Commitemnt Problem British Test System Forecasts and Scenarios Rolling Horizon Evaluation Comparisons Conclusion Our Motivation
More informationRobust Scheduling with Logic-Based Benders Decomposition
Robust Scheduling with Logic-Based Benders Decomposition Elvin Çoban and Aliza Heching and J N Hooker and Alan Scheller-Wolf Abstract We study project scheduling at a large IT services delivery center
More informationEnergy System Modelling Summer Semester 2018, Lecture 7
Energy System Modelling Summer Semester 2018, Lecture 7 Dr. Tom Brown, tom.brown@kit.edu, https://nworbmot.org/ Karlsruhe Institute of Technology (KIT), Institute for Automation and Applied Informatics
More informationA Robust Optimization Approach to the Self-scheduling Problem Using Semidefinite Programming
A Robust Optimization Approach to the Self-scheduling Problem Using Semidefinite Programming by Jason Conrad Landry A thesis presented to the University of Waterloo in fulfillment of the thesis requirement
More informationNonlinear Programming (Hillier, Lieberman Chapter 13) CHEM-E7155 Production Planning and Control
Nonlinear Programming (Hillier, Lieberman Chapter 13) CHEM-E7155 Production Planning and Control 19/4/2012 Lecture content Problem formulation and sample examples (ch 13.1) Theoretical background Graphical
More informationA Stochastic-Oriented NLP Relaxation for Integer Programming
A Stochastic-Oriented NLP Relaxation for Integer Programming John Birge University of Chicago (With Mihai Anitescu (ANL/U of C), Cosmin Petra (ANL)) Motivation: The control of energy systems, particularly
More informationStatus of the CWE Flow Based Market Coupling Project
Commissie voor de Regulering van de Elektriciteit en het Gas Commission pour la Régulation de l Electricité et du Gaz Status of the CWE Flow Based Market Coupling Project Joint NordREG / Nordic TSO workshop
More informationUsing Integer Programming for Strategic Underground and Open Pit-to-Underground Scheduling
Using Integer Programming for Strategic Underground and Open Pit-to-Underground Scheduling Barry King Advisor: Alexandra Newman Operations Research with Engineering PhD Program August 5-6, 2016 Cutoff
More informationAn RLT Approach for Solving Binary-Constrained Mixed Linear Complementarity Problems
An RLT Approach for Solving Binary-Constrained Mixed Linear Complementarity Problems Miguel F. Anjos Professor and Canada Research Chair Director, Trottier Institute for Energy TAI 2015 Washington, DC,
More informationMulti-Area Stochastic Unit Commitment for High Wind Penetration
Multi-Area Stochastic Unit Commitment for High Wind Penetration Workshop on Optimization in an Uncertain Environment Anthony Papavasiliou, UC Berkeley Shmuel S. Oren, UC Berkeley March 25th, 2011 Outline
More informationDecision Models Lecture 5 1. Lecture 5. Foreign-Currency Trading Integer Programming Plant-location example Summary and Preparation for next class
Decision Models Lecture 5 1 Lecture 5 Foreign-Currency Trading Integer Programming Plant-location example Summary and Preparation for next class Foreign Exchange (FX) Markets Decision Models Lecture 5
More informationNon-uniform pricing and thermal orders for the day-ahead Market
Non-uniform pricing and thermal orders for the day-ahead Market PCR Stakeholder forum Brussels, January 11, 2016 Pricing: the current design Which requirements are concerned? Blocks, smart orders (and
More informationOverview of course. Introduction to Optimization, DIKU Monday 12 November David Pisinger
Introduction to Optimization, DIKU 007-08 Monday November David Pisinger Lecture What is OR, linear models, standard form, slack form, simplex repetition, graphical interpretation, extreme points, basic
More informationThe System's Limitations Costs Determination Using the Duality Concept of Linear Programming
Volume 3, Number 1, 1 he System's Limitations Costs etermination Using the uality Concept of Linear rogramming MAHNIKO Anatolijs, UMBRASHKO Inga, VARFOLOMEJEVA Renata Riga echnical University, Institute
More informationNONLINEAR. (Hillier & Lieberman Introduction to Operations Research, 8 th edition)
NONLINEAR PROGRAMMING (Hillier & Lieberman Introduction to Operations Research, 8 th edition) Nonlinear Programming g Linear programming has a fundamental role in OR. In linear programming all its functions
More informationLinear and Integer Programming - ideas
Linear and Integer Programming - ideas Paweł Zieliński Institute of Mathematics and Computer Science, Wrocław University of Technology, Poland http://www.im.pwr.wroc.pl/ pziel/ Toulouse, France 2012 Literature
More informationSURVIVABLE ENERGY MARKETS
SURVIVABLE ENERGY MARKETS GABRIELLA MURATORE Abstract. In this paper we present a centralized model for managing, at the same time, the dayahead energy market and the reserve market in order to price through
More informationBilevel Programming-Based Unit Commitment for Locational Marginal Price Computation
Bilevel Programming-Based Unit Commitment for Locational Marginal Price Computation Presentation at 50 th North American Power Symposium Abdullah Alassaf Department of Electrical Engineering University
More informationShort-Term Demand Forecasting Methodology for Scheduling and Dispatch
Short-Term Demand Forecasting Methodology for Scheduling and Dispatch V1.0 March 2018 Table of Contents 1 Introduction... 3 2 Historical Jurisdictional Demand Data... 3 3 EMS Demand Forecast... 4 3.1 Manual
More informationLINEAR PROGRAMMING II
LINEAR PROGRAMMING II LP duality strong duality theorem bonus proof of LP duality applications Lecture slides by Kevin Wayne Last updated on 7/25/17 11:09 AM LINEAR PROGRAMMING II LP duality Strong duality
More informationChapter 5. Transmission networks and electricity markets
Chapter 5. Transmission networks and electricity markets 1 Introduction In most of the regions of the world: assumptions that electrical energy can be traded as if all generators were connected to the
More informationLecture 18: Optimization Programming
Fall, 2016 Outline Unconstrained Optimization 1 Unconstrained Optimization 2 Equality-constrained Optimization Inequality-constrained Optimization Mixture-constrained Optimization 3 Quadratic Programming
More informationEconomic Foundations of Symmetric Programming
Economic Foundations of Symmetric Programming QUIRINO PARIS University of California, Davis B 374309 CAMBRIDGE UNIVERSITY PRESS Foreword by Michael R. Caputo Preface page xv xvii 1 Introduction 1 Duality,
More informationBringing Renewables to the Grid. John Dumas Director Wholesale Market Operations ERCOT
Bringing Renewables to the Grid John Dumas Director Wholesale Market Operations ERCOT 2011 Summer Seminar August 2, 2011 Quick Overview of ERCOT The ERCOT Market covers ~85% of Texas overall power usage
More informationA new stochastic program to facilitate intermittent renewable generation
A new stochastic program to facilitate intermittent renewable generation Golbon Zakeri Geoff Pritchard, Mette Bjorndal, Endre Bjorndal EPOC UoA and Bergen, IPAM 2016 Premise for our model Growing need
More information2.098/6.255/ Optimization Methods Practice True/False Questions
2.098/6.255/15.093 Optimization Methods Practice True/False Questions December 11, 2009 Part I For each one of the statements below, state whether it is true or false. Include a 1-3 line supporting sentence
More informationColumn Generation for Extended Formulations
1 / 28 Column Generation for Extended Formulations Ruslan Sadykov 1 François Vanderbeck 2,1 1 INRIA Bordeaux Sud-Ouest, France 2 University Bordeaux I, France ISMP 2012 Berlin, August 23 2 / 28 Contents
More informationInteger Linear Programming (ILP)
Integer Linear Programming (ILP) Zdeněk Hanzálek, Přemysl Šůcha hanzalek@fel.cvut.cz CTU in Prague March 8, 2017 Z. Hanzálek (CTU) Integer Linear Programming (ILP) March 8, 2017 1 / 43 Table of contents
More informationValid Inequalities for Optimal Transmission Switching
Valid Inequalities for Optimal Transmission Switching Hyemin Jeon Jeff Linderoth Jim Luedtke Dept. of ISyE UW-Madison Burak Kocuk Santanu Dey Andy Sun Dept. of ISyE Georgia Tech 19th Combinatorial Optimization
More informationAccelerating the Convergence of Stochastic Unit Commitment Problems by Using Tight and Compact MIP Formulations
Accelerating the Convergence of Stochastic Unit Commitment Problems by Using Tight and Compact MIP Formulations Germán Morales-España, and Andrés Ramos Delft University of Technology, Delft, The Netherlands
More information1 Review Session. 1.1 Lecture 2
1 Review Session Note: The following lists give an overview of the material that was covered in the lectures and sections. Your TF will go through these lists. If anything is unclear or you have questions
More informationThe Dual Simplex Algorithm
p. 1 The Dual Simplex Algorithm Primal optimal (dual feasible) and primal feasible (dual optimal) bases The dual simplex tableau, dual optimality and the dual pivot rules Classical applications of linear
More informationAccelerating the Convergence of MIP-based Unit Commitment Problems
Accelerating the Convergence of MIP-based Unit Commitment Problems The Impact of High Quality MIP Formulations ermán Morales-España, Delft University of Technology, Delft, The Netherlands Optimization
More informationDM545 Linear and Integer Programming. Lecture 13 Branch and Bound. Marco Chiarandini
DM545 Linear and Integer Programming Lecture 13 Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 2 Exam Tilladt Håndscanner/digital pen og ordbogsprogrammet
More informationCongestion Management in a Smart Grid via Shadow Prices
Congestion Management in a Smart Grid via Shadow Prices Benjamin Biegel, Palle Andersen, Jakob Stoustrup, Jan Bendtsen Systems of Systems October 23, 2012 1 This presentation use of distributed Receding
More informationChapter 1: Linear Programming
Chapter 1: Linear Programming Math 368 c Copyright 2013 R Clark Robinson May 22, 2013 Chapter 1: Linear Programming 1 Max and Min For f : D R n R, f (D) = {f (x) : x D } is set of attainable values of
More informationARE202A, Fall 2005 CONTENTS. 1. Graphical Overview of Optimization Theory (cont) Separating Hyperplanes 1
AREA, Fall 5 LECTURE #: WED, OCT 5, 5 PRINT DATE: OCTOBER 5, 5 (GRAPHICAL) CONTENTS 1. Graphical Overview of Optimization Theory (cont) 1 1.4. Separating Hyperplanes 1 1.5. Constrained Maximization: One
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 8 Discrete optimization: theory and algorithms
MVE165/MMG631 Linear and integer optimization with applications Lecture 8 Discrete optimization: theory and algorithms Ann-Brith Strömberg 2017 04 07 Lecture 8 Linear and integer optimization with applications
More informationICS-E4030 Kernel Methods in Machine Learning
ICS-E4030 Kernel Methods in Machine Learning Lecture 3: Convex optimization and duality Juho Rousu 28. September, 2016 Juho Rousu 28. September, 2016 1 / 38 Convex optimization Convex optimisation This
More informationNumerical optimization
Numerical optimization Lecture 4 Alexander & Michael Bronstein tosca.cs.technion.ac.il/book Numerical geometry of non-rigid shapes Stanford University, Winter 2009 2 Longest Slowest Shortest Minimal Maximal
More information21. Set cover and TSP
CS/ECE/ISyE 524 Introduction to Optimization Spring 2017 18 21. Set cover and TSP ˆ Set covering ˆ Cutting problems and column generation ˆ Traveling salesman problem Laurent Lessard (www.laurentlessard.com)
More informationLinear Programming Versus Convex Quadratic Programming for the Module Allocation Problem
Linear Programming Versus Convex Quadratic Programming for the Module Allocation Problem Sourour Elloumi 1 April 13, 2005 Abstract We consider the Module Allocation Problem with Non-Uniform communication
More informationEconS Oligopoly - Part 2
EconS 305 - Oligopoly - Part 2 Eric Dunaway Washington State University eric.dunaway@wsu.edu November 29, 2015 Eric Dunaway (WSU) EconS 305 - Lecture 32 November 29, 2015 1 / 28 Introduction Last time,
More informationSolving a Class of Generalized Nash Equilibrium Problems
Journal of Mathematical Research with Applications May, 2013, Vol. 33, No. 3, pp. 372 378 DOI:10.3770/j.issn:2095-2651.2013.03.013 Http://jmre.dlut.edu.cn Solving a Class of Generalized Nash Equilibrium
More informationCoordinated Aggregation of Distributed Resources
Coordinated Aggregation of Distributed Resources UC Berkeley October 13, 2011 Coordinated Aggregation 1 of 39 Co-conspirators Anand Subramanian, Manuel Garcia, Josh Taylor [Berkeley Students] Duncan Callaway,
More informationLearning to Branch. Ellen Vitercik. Joint work with Nina Balcan, Travis Dick, and Tuomas Sandholm. Published in ICML 2018
Learning to Branch Ellen Vitercik Joint work with Nina Balcan, Travis Dick, and Tuomas Sandholm Published in ICML 2018 1 Integer Programs (IPs) a maximize subject to c x Ax b x {0,1} n 2 Facility location
More informationBrief summary of linear programming and duality: Consider the linear program in standard form. (P ) min z = cx. x 0. (D) max yb. z = c B x B + c N x N
Brief summary of linear programming and duality: Consider the linear program in standard form (P ) min z = cx s.t. Ax = b x 0 where A R m n, c R 1 n, x R n 1, b R m 1,and its dual (D) max yb s.t. ya c.
More informationPredicting the Electricity Demand Response via Data-driven Inverse Optimization
Predicting the Electricity Demand Response via Data-driven Inverse Optimization Workshop on Demand Response and Energy Storage Modeling Zagreb, Croatia Juan M. Morales 1 1 Department of Applied Mathematics,
More informationPART 4 INTEGER PROGRAMMING
PART 4 INTEGER PROGRAMMING 102 Read Chapters 11 and 12 in textbook 103 A capital budgeting problem We want to invest $19 000 Four investment opportunities which cannot be split (take it or leave it) 1.
More informationUSAEE/IAEE. Diagnostic metrics for the adequate development of efficient-market baseload natural gas storage capacity.
USAEE/IAEE Diagnostic metrics for the adequate development of efficient-market baseload natural gas storage capacity Colorado School of Mines November 13, 2017 Contact: eguzman.phd@gmail.com 1 / 28 Introduction
More informationMulti-Area Interchange Scheduling under Uncertainty
1 Multi-Area Interchange Scheduling under Uncertainty Yuting Ji, Student Member, IEEE, and Lang Tong, Fellow, IEEE arxiv:1611.05012v1 [math.oc] 15 Nov 2016 Abstract The problem of multi-area interchange
More informationInteger Programming Part II
Be the first in your neighborhood to master this delightful little algorithm. Integer Programming Part II The Branch and Bound Algorithm learn about fathoming, bounding, branching, pruning, and much more!
More informationDual decomposition approach for dynamic spatial equilibrium models
Dual decomposition approach for dynamic spatial equilibrium models E. Allevi (1), A. Gnudi (2), I.V. Konnov (3), G. Oggioni (1) (1) University of Brescia, Italy (2) University of Bergamo, Italy (3) Kazan
More informationDistributed Optimization. Song Chong EE, KAIST
Distributed Optimization Song Chong EE, KAIST songchong@kaist.edu Dynamic Programming for Path Planning A path-planning problem consists of a weighted directed graph with a set of n nodes N, directed links
More informationSoftware Tools: Congestion Management
Software Tools: Congestion Management Tom Qi Zhang, PhD CompuSharp Inc. (408) 910-3698 Email: zhangqi@ieee.org October 16, 2004 IEEE PES-SF Workshop on Congestion Management Contents Congestion Management
More informationLinear Programming: Simplex
Linear Programming: Simplex Stephen J. Wright 1 2 Computer Sciences Department, University of Wisconsin-Madison. IMA, August 2016 Stephen Wright (UW-Madison) Linear Programming: Simplex IMA, August 2016
More information