Economic MPC for large and distributed energy systems

Size: px
Start display at page:

Download "Economic MPC for large and distributed energy systems"

Transcription

1 Economic MPC for large and distributed energy systems WP4 Laura Standardi, Niels Kjølstad Poulsen, John Bagterp Jørgensen August 15, / 34

2 Outline Introduction and motivation Problem definition Economic Model Predictive Control First & Second outcome Dantzig-Wolfe Vs. Centralized MPC Dantzig-Wolfe Vs. LP solvers Third & Forth outcome Early termination Reduced Dantzig-Wolfe Conclusion 2 / 34

3 Current section Introduction and motivation Problem definition Economic Model Predictive Control First & Second outcome Dantzig-Wolfe Vs. Centralized MPC Dantzig-Wolfe Vs. LP solvers Third & Forth outcome Early termination Reduced Dantzig-Wolfe Conclusion 3 / 34

4 Denmark and its energy future (* Wind Wind + other RE sources Non-wind Danish Climate Goals % wind in electricity sector 2030 All coal power plants decommissioned % renewables in electricity & heating sector 100% renewables in all energy sectors 4 / 34

5 Future energy systems Actual energy scenario Old, not updated Centralized energy production Losses Future increase in energy consumption CO 2 emissions High oil prices Domino effects after fault 5 / 34

6 Future energy systems Actual energy scenario Old, not updated Centralized energy production Losses Future increase in energy consumption CO 2 emissions High oil prices Domino effects after fault Future energy scenario Embody ICT (Information and Communication Technology) DER (Distributed Energy Resources) Reduced losses Flexibility RES (Renewable Energy Sources) Less dependent of fossil fuel Higher reliability after fault 5 / 34

7 Large and distributed energy systems 6 / 34

8 Large and distributed energy systems Operation center: Control and coordinate energy units Minimize production costs and meet energy consumption 6 / 34

9 Current section Introduction and motivation Problem definition Economic Model Predictive Control First & Second outcome Dantzig-Wolfe Vs. Centralized MPC Dantzig-Wolfe Vs. LP solvers Third & Forth outcome Early termination Reduced Dantzig-Wolfe Conclusion 7 / 34

10 Energy units Linear state-space models x k+1 = Ax k + Bu k + Gw k y k = Cx k + v k z k = C z x k Linear constraints on input and output variables u min u k u max u min u k u max r min,k s k z k r max,k + s k s k 0 8 / 34

11 Linear control problem Linear production costs 1 φ = lim N N N c k u k + ρ k s k k=0 Linear models Linear constraints Linear production costs Linear control problem 9 / 34

12 Current section Introduction and motivation Problem definition Economic Model Predictive Control First & Second outcome Dantzig-Wolfe Vs. Centralized MPC Dantzig-Wolfe Vs. LP solvers Third & Forth outcome Early termination Reduced Dantzig-Wolfe Conclusion 10 / 34

13 Controller Energy demand Coordinator Economic MPC formulated as a LP. Power unit 1 Power unit 2 Minimize production costs. Meet customers consumption Power plant portfolio Power production Time 11 / 34

14 Electricl grid: multiple energy units P = {1,..., P } energy units x i,k+1 = A i x i,k + B i u i,k + G i w k y i,k = C i x i,k + v i,k z i,k = C z,i x i,k i P i P i P the total electric power provided to the grid is z k, ỹ k ỹ k = z k = P i=1 P i=1 C i x i,k + ṽ k C z,i x i,k 12 / 34

15 Linear Economic Model Predictive Control (MPC) min φ k = û k+j k,ŝ k+j+1 k P i=1 N 1 φ i,k + j=0 ˆ ρ k+j+1 kˆ s k+j+1 k s.t. ˆx i,k+j+1 k = A iˆx i,k+j k + B i û i,k+j k + E i ˆdk+j k ẑ i,k+j+1 k = C z,iˆx i,k+j+1 k u min,i û i,k+j k u max,i u min,i û i,k+j k u max,i ẑ i,k+j+1 k + ŝ i,k+j+1 k ˆr min,i,k+j+1 k, ŝ i,k+j+1 k 0 ẑ i,k+j+1 k ŝ i,k+j+1 k ˆr max,i,k+j+1 k, ŝ i,k+j+1 k 0 P ˆ z k+j+1 k = C iˆx i,k+j+1 k i=1 ˆ z k+j+1 k + ˆ s k+j+1 k ˆ r min,k+j+1 k, ˆ s k+j+1 k 0 ˆ z k+j+1 k ˆ s k+j+1 k ˆ r max,k+j+1 k, ˆ s k+j+1 k 0 13 / 34

16 Compute optimal input sequence Many variables and constraints High computation time Fast computation of the optimal input sequence. Reliable and efficient controller. If not optimal, is a feasible solution acceptable? 14 / 34

17 Current section Introduction and motivation Problem definition Economic Model Predictive Control First & Second outcome Dantzig-Wolfe Vs. Centralized MPC Dantzig-Wolfe Vs. LP solvers Third & Forth outcome Early termination Reduced Dantzig-Wolfe Conclusion 15 / 34

18 Decomposition techniques Control problem has a specific matrix constraint (block-angular). Coup. Constr. 1 Coup. Constr Dec. Constr. 1 Coup. Constr. M-1 Coup. Constr. M Dec. Constr Dec. Constr. M-1 Dec. Constr. M Decomposition technique applied to our control problem: Exploit such block-angular structure Reduce computational time Introduce scalability 16 / 34

19 Dantzig-Wolfe algorithm: key parts Dantzig-Wolfe decomposition applies to LPs that have block-angular constraints matrix. 1. Dantzig-Wolfe representation = RMP. 2. Subproblems. 3. Optimality condition. 17 / 34

20 Dantzig-Wolfe decomposition Setup RMP with initial feasible vertex via DW representation Solve RMP and send simplex multipliers to subproblems Update cost coefficients of each subproblem. Add one column to the RMP. Solve all subproblems. Optimal solution found. Yes Is the optimality condition satisfied? 18 / 34

21 First outcome Computational time (seconds) Centralized MPC Dantzig Wolfe Parallel computing Number of power units Laura Standardi, Kristian Edlund, Niels Kjølstad Poulsen, John Bagterp Jørgensen, A Dantzig-Wolfe decomposition algorithm for linear Economic MPC of a Power Plant Portfolio, 10 th European Workshop on advanced control and diagnosis, ACD / 34

22 CLE SecondIN outcome PRESS al. / Journal of Process Control xxx (2014) xxx xxx ce settings. 0K 1 Pro opersolving the ating units. Wempc and he OCP for lgorithms. h accuracy, Table 4 is Fig. 7. CPU time for the different solvers as a function of the number of power generating units, M. Leo Emil Sokoler, Laura Standardi, Kristian Edlund, Niels Kjølstad Poulsen, John Bagterp Jørgensen, A Dantzig-Wolfe decomposition algorithm for linear economic model predictive control of dynamically decoupled systems, Journal of Process Control an attractive optimization algorithm for large scale dynamically decoupled energy management problems. Note from Fig. 6 that ADMMempc needs many more iterations to converge than DWempc for the high accuracy tolerance specification, (h). Table 5 further shows that the number of iterations increases 20 / 34

23 Current section Introduction and motivation Problem definition Economic Model Predictive Control First & Second outcome Dantzig-Wolfe Vs. Centralized MPC Dantzig-Wolfe Vs. LP solvers Third & Forth outcome Early termination Reduced Dantzig-Wolfe Conclusion 21 / 34

24 Suboptimal solution Suboptimal solutions but feasible. This brings a reduction in computation time. Extra costs might occur. Early termination Fix a maximum number of iterations to the DW algorithm. The solution is not optimal, but feasible. 22 / 34

25 Early termination Setup RMP with initial feasible vertex via DW representation Solve RMP and send simplex multipliers to subproblems Update cost coefficients of each subproblem. Solve all subproblems. Add one column to the RMP. Suboptimal solution found. Optimal solution found. Yes Yes Is the number of iterations a fixed number? No Is the optimality condition satisfied? 23 / 34

26 Early termination: set bound on iterations a priori First iteration: 10 vertices provides the optimal value but the algorithm stops after 32 extreme points Obj. Func. (time step 1) Obj. Func. (time step 100) Number of extreme points l 100 th iteration: the warm-start reduces the number of vertices required to 13 but 3 are enough to compute the optimal value. 24 / 34

27 Early termination performances: computational time Distributions based on 20 stochastic simulations. 8 8 Exact Dantzig-Wolfe algorithm. Early termination 15 vertices. Early termination 10 vertices. Early termination 5 vertices CPU time [s] CPU time [s] CPU time [s] CPU time [s] 25 / 34

28 Early termination performances: costs Distributions based on 20 stochastic simulations. 8 6 Exact Dantzig-Wolfe algorithm. Early termination 15 vertices. Early termination 10 vertices. Early termination 5 vertices Costs [million euro] Costs [million euro] Costs [million euro] Costs [million euro] 26 / 34

29 Third outcome: Early termination Laura Standardi, Leo Emil Sokoler, Niels Kjølstad Poulsen, John Bagterp Jørgensen, Computational Efficiency of Economic MPC for Power System Operation, 4 th IEEE PES Innovative Smart Grid Technologies Europe, / 34

30 Reduced Dantzig-Wolfe decomposition No need of max. number of iterations set a priori. Reduce computation time. Improve applicability of the controller. 28 / 34

31 Reduced Dantzig-Wolfe Initial feasible vertex for RMP coeff. Solve RMP and send simplex multipliers to subproblems Update cost coefficients of each subproblem left. Solve subproblems left. Add one column to the RMP only for the subproblems left. Yes Is the optimality condition satisfied for any subproblem? These subproblem are not solved. All suproblems have satisfied opt. condition Subptimal solution found. 29 / 34

32 Forth outcome: reduced Dantzig-Wolfe 10 5 CPU time [s] 10 4 DW Reduced DW Power units 10 8 Obj. func.[euro] 10 6 DW Reduced DW Power units 30 / 34

33 Forth outcome: reduced Dantzig-Wolfe Laura Standardi, John Bagterp Jørgensen, Niels Kjølstad Poulsen, A reduced Dantzig-Wolfe decomposition for a suboptimal linear MPC, 19 th IFAC World Congress / 34

34 Current section Introduction and motivation Problem definition Economic Model Predictive Control First & Second outcome Dantzig-Wolfe Vs. Centralized MPC Dantzig-Wolfe Vs. LP solvers Third & Forth outcome Early termination Reduced Dantzig-Wolfe Conclusion 32 / 34

35 Papers 1. A reduced Dantzig-Wolfe decomposition for a suboptimal linear MPC, L.Standardi, N. Kjølstad Poulsen, J. Bagterp Jørgensen, 19 th IFAC World Congress, A Dantzig-Wolfe decomposition algorithm for linear economic model predictive control of dynamically decoupled subsystems, L. Emil Sokoler, L. Standardi, K. Edlund, J. Bagterp Jørgensen, N. Kjølstad Poulsen, Journal of Process Control, Comptuational efficiency of Economic MPC for power systems operation, L.Standardi,L. Emil Sokoler, N. Kjølstad Poulsen, J. Bagterp Jørgensen, 4 th IEEE PES ISGT, A decomposition algorithm for optimal control of distributed energy system, L. Emil Sokoler, L.Standardi, N. Kjølstad Poulsen, J. Bagterp Jørgensen, 4 th IEEE PES ISGT, Early termination of Dantzig-Wolfe algorithm for economic MPC, L.Standardi, L. Emil Sokoler, N. Kjølstad Poulsen, J. Bagterp Jørgensen, 18 th NPCW, A Dantzig-Wolfe decomposition algorithm for economic MPC of distributed energy systems, L. Emil Sokoler, L.Standardi, N. Kjølstad Poulsen, J. Bagterp Jørgensen, 18 th NPCW, A Dantzig-Wolfe decomposition algorithm for linear economic MPC of a power plant portfolio, L.Standardi, L. Emil Sokoler, N. Kjølstad Poulsen, J. Bagterp Jørgensen, ACD / 34

36 Conclusion Over the last three years we have: Speeded up controllers applied to smart grids, Increased scalability of the control systems, Analysed the consequences of suboptimal control sequences, Cooperated with DONG energy. 34 / 34

37 Conclusion Over the last three years we have: Speeded up controllers applied to smart grids, Increased scalability of the control systems, Analysed the consequences of suboptimal control sequences, Cooperated with DONG energy. Thank you all 34 / 34

A Dantzig-Wolfe Decomposition Algorithm for Economic MPC of Distributed Energy Systems

A Dantzig-Wolfe Decomposition Algorithm for Economic MPC of Distributed Energy Systems A Dantzig-Wolfe Decomposition Algorithm for Economic MPC of Distributed Energy Systems Leo Emil Sokoler, Laura Standardi Kristian Edlund John Bagterp Jørgensen DONG Energy, DK-2820 Gentofte, Denmark (kried@dongenergydk)

More information

Verteilte modellprädiktive Regelung intelligenter Stromnetze

Verteilte modellprädiktive Regelung intelligenter Stromnetze Verteilte modellprädiktive Regelung intelligenter Stromnetze Institut für Mathematik Technische Universität Ilmenau in Zusammenarbeit mit Philipp Braun, Lars Grüne (U Bayreuth) und Christopher M. Kellett,

More information

Distributed and Real-time Predictive Control

Distributed and Real-time Predictive Control Distributed and Real-time Predictive Control Melanie Zeilinger Christian Conte (ETH) Alexander Domahidi (ETH) Ye Pu (EPFL) Colin Jones (EPFL) Challenges in modern control systems Power system: - Frequency

More information

Decomposition methods in optimization

Decomposition methods in optimization Decomposition methods in optimization I Approach I: I Partition problem constraints into two groups: explicit and implicit I Approach II: I Partition decision variables into two groups: primary and secondary

More information

Grey-box modelling; Bridging the gap between physical and statistical modelling

Grey-box modelling; Bridging the gap between physical and statistical modelling Grey-box modelling; Bridging the gap between physical and statistical modelling Energy Flexibility in Zero-Emission Neighborhoods, Oslo, November 2017 Henrik Madsen www.henrikmadsen.org Introduction

More information

Distributed Model Predictive Control for Smart Energy Systems

Distributed Model Predictive Control for Smart Energy Systems IEEE TRANSACTIONS ON SMART GRID, VOL. 7, NO. 3, MAY 2016 1675 Distributed Model Predictive Control for Smart Energy Systems Rasmus Halvgaard, Lieven Vandenberghe, Niels Kølstad Poulsen, Henrik Madsen,

More information

Distributed Model Predictive Control for Smart Energy Systems

Distributed Model Predictive Control for Smart Energy Systems JOURNAL OF L A TEX CLASS FILES, VOL. 11, NO. 4, DECEMBER 214 1 Distributed Model Predictive Control for Smart Energy Systems Rasmus Halvgaard, Lieven Vandenberghe, Niels K. Poulsen, Henrik Madsen, and

More information

Column Generation for Extended Formulations

Column 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 information

Benders Decomposition Methods for Structured Optimization, including Stochastic Optimization

Benders Decomposition Methods for Structured Optimization, including Stochastic Optimization Benders Decomposition Methods for Structured Optimization, including Stochastic Optimization Robert M. Freund April 29, 2004 c 2004 Massachusetts Institute of echnology. 1 1 Block Ladder Structure We consider

More information

Hierarchical model-based predictive control of a power plant portfolio Edlund, Kristian Skjoldborg; Bendtsen, Jan Dimon; Jørgensen, John Bagterp

Hierarchical model-based predictive control of a power plant portfolio Edlund, Kristian Skjoldborg; Bendtsen, Jan Dimon; Jørgensen, John Bagterp Aalborg Universitet Hierarchical model-based predictive control of a power plant portfolio Edlund, Kristian Skjoldborg; Bendtsen, Jan Dimon; Jørgensen, John Bagterp Published in: Control Engineering Practice

More information

Thermal Storage Power Balancing with Model Predictive Control

Thermal Storage Power Balancing with Model Predictive Control 213 European Control Conference (ECC) July 17-19, 213, Zürich, Switzerland. Thermal Storage Power Balancing with Model Predictive Control Rasmus Halvgaard, Niels K. Poulsen, Henrik Madsen and John B. Jørgensen

More information

Benders Decomposition Methods for Structured Optimization, including Stochastic Optimization

Benders Decomposition Methods for Structured Optimization, including Stochastic Optimization Benders Decomposition Methods for Structured Optimization, including Stochastic Optimization Robert M. Freund May 2, 2001 Block Ladder Structure Basic Model minimize x;y c T x + f T y s:t: Ax = b Bx +

More information

A Homogeneous and Self-Dual Interior-Point Linear Programming Algorithm for Economic Model Predictive Control

A Homogeneous and Self-Dual Interior-Point Linear Programming Algorithm for Economic Model Predictive Control SUBMITTED FOR IEEE TRANSACTIONS ON AUTOMATIC CONTROL AUGUST 2 214 1 A Homogeneous and Self-Dual Interior-Point Linear Programming Algorithm for Economic Model Predictive Control Leo Emil Sokoler Gianluca

More information

R O B U S T E N E R G Y M AN AG E M E N T S Y S T E M F O R I S O L AT E D M I C R O G R I D S

R O B U S T E N E R G Y M AN AG E M E N T S Y S T E M F O R I S O L AT E D M I C R O G R I D S ROBUST ENERGY MANAGEMENT SYSTEM FOR ISOLATED MICROGRIDS Jose Daniel La r a Claudio Cañizares Ka nka r Bhattacharya D e p a r t m e n t o f E l e c t r i c a l a n d C o m p u t e r E n g i n e e r i n

More information

Aalborg Universitet. Hierarchical Control for Smart Grids. Trangbæk, K; Bendtsen, Jan Dimon; Stoustrup, Jakob

Aalborg Universitet. Hierarchical Control for Smart Grids. Trangbæk, K; Bendtsen, Jan Dimon; Stoustrup, Jakob Downloaded from vbn.aau.dk on: marts 11, 219 Aalborg Universitet Hierarchical Control for Smart Grids Trangbæk, K; Bendtsen, Jan Dimon; Stoustrup, Jakob Published in: Proceedings of the 18th IFAC World

More information

A Homogeneous and Self-Dual Interior-Point Linear Programming Algorithm for Economic Model Predictive Control

A Homogeneous and Self-Dual Interior-Point Linear Programming Algorithm for Economic Model Predictive Control SUBMITTED FOR IEEE TRANSACTIONS ON AUTOMATIC CONTROL SEPTEMBER 24 213 1 A Homogeneous and Self-Dual Interior-Point Linear Programming Algorithm for Economic Model Predictive Control Leo Emil Sooler Gianluca

More information

Contents Economic dispatch of thermal units

Contents Economic dispatch of thermal units Contents 2 Economic dispatch of thermal units 2 2.1 Introduction................................... 2 2.2 Economic dispatch problem (neglecting transmission losses)......... 3 2.2.1 Fuel cost characteristics........................

More information

F 1 F 2 Daily Requirement Cost N N N

F 1 F 2 Daily Requirement Cost N N N Chapter 5 DUALITY 5. The Dual Problems Every linear programming problem has associated with it another linear programming problem and that the two problems have such a close relationship that whenever

More information

Column Generation. ORLAB - Operations Research Laboratory. Stefano Gualandi. June 14, Politecnico di Milano, Italy

Column Generation. ORLAB - Operations Research Laboratory. Stefano Gualandi. June 14, Politecnico di Milano, Italy ORLAB - Operations Research Laboratory Politecnico di Milano, Italy June 14, 2011 Cutting Stock Problem (from wikipedia) Imagine that you work in a paper mill and you have a number of rolls of paper of

More information

Introducing Model Predictive Control for Improving Power Plant Portfolio Performance

Introducing Model Predictive Control for Improving Power Plant Portfolio Performance Proceedings of the 17th World Congress The International Federation of Automatic Control Seoul, Korea, July 6-11, 28 Introducing Model Predictive Control for Improving Power Plant Portfolio Performance

More information

Linear and Combinatorial Optimization

Linear and Combinatorial Optimization Linear and Combinatorial Optimization The dual of an LP-problem. Connections between primal and dual. Duality theorems and complementary slack. Philipp Birken (Ctr. for the Math. Sc.) Lecture 3: Duality

More information

Distributed estimation based on multi-hop subspace decomposition

Distributed estimation based on multi-hop subspace decomposition Distributed estimation based on multi-hop subspace decomposition Luca Zaccarian 2,3 Joint work with A.R. del Nozal 1, P. Millán 1, L. Orihuela 1, A. Seuret 2 1 Departamento de Ingeniería, Universidad Loyola

More information

Lecture 2: The Simplex method. 1. Repetition of the geometrical simplex method. 2. Linear programming problems on standard form.

Lecture 2: The Simplex method. 1. Repetition of the geometrical simplex method. 2. Linear programming problems on standard form. Lecture 2: The Simplex method. Repetition of the geometrical simplex method. 2. Linear programming problems on standard form. 3. The Simplex algorithm. 4. How to find an initial basic solution. Lecture

More information

Single Shooting and ESDIRK Methods for adjoint-based optimization of an oil reservoir

Single Shooting and ESDIRK Methods for adjoint-based optimization of an oil reservoir Downloaded from orbit.dtu.dk on: Dec 2, 217 Single Shooting and ESDIRK Methods for adjoint-based optimization of an oil reservoir Capolei, Andrea; Völcker, Carsten; Frydendall, Jan; Jørgensen, John Bagterp

More information

Optimal dispatch strategy for the agile virtual power plant Petersen, Mette Kirschmeyer; Bendtsen, Jan Dimon; Stoustrup, Jakob

Optimal dispatch strategy for the agile virtual power plant Petersen, Mette Kirschmeyer; Bendtsen, Jan Dimon; Stoustrup, Jakob Aalborg Universitet Optimal dispatch strategy for the agile virtual power plant Petersen, Mette Kirschmeyer; Bendtsen, Jan Dimon; Stoustrup, Jakob Published in: 2012 American Control Conference Publication

More information

R u t c o r Research R e p o r t. The Optimization of the Move of Robot Arm by Benders Decomposition. Zsolt Robotka a RRR , DECEMBER 2005

R u t c o r Research R e p o r t. The Optimization of the Move of Robot Arm by Benders Decomposition. Zsolt Robotka a RRR , DECEMBER 2005 R u t c o r Research R e p o r t The Optimization of the Move of Robot Arm by Benders Decomposition Zsolt Robotka a Béla Vizvári b RRR 43-2005, DECEMBER 2005 RUTCOR Rutgers Center for Operations Research

More information

Outline. Relaxation. Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING. 1. Lagrangian Relaxation. Lecture 12 Single Machine Models, Column Generation

Outline. Relaxation. Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING. 1. Lagrangian Relaxation. Lecture 12 Single Machine Models, Column Generation Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING 1. Lagrangian Relaxation Lecture 12 Single Machine Models, Column Generation 2. Dantzig-Wolfe Decomposition Dantzig-Wolfe Decomposition Delayed Column

More information

Stochastic Programming Models in Design OUTLINE

Stochastic Programming Models in Design OUTLINE Stochastic Programming Models in Design John R. Birge University of Michigan OUTLINE Models General - Farming Structural design Design portfolio General Approximations Solutions Revisions Decision: European

More information

Introduction to Integer Linear Programming

Introduction to Integer Linear Programming Lecture 7/12/2006 p. 1/30 Introduction to Integer Linear Programming Leo Liberti, Ruslan Sadykov LIX, École Polytechnique liberti@lix.polytechnique.fr sadykov@lix.polytechnique.fr Lecture 7/12/2006 p.

More information

On pollution and R&D-based growth in a trade model between countries concerned and unconcerned about climate change

On pollution and R&D-based growth in a trade model between countries concerned and unconcerned about climate change On pollution and R&D-based growth in a trade model between countries concerned and unconcerned about climate change Francisco Cabo 1 Guiomar Martín-Herrán 1 M.Pilar Martínez-García 2 1 IMUVa, Dpt. Economía

More information

Distributed model predictive control based on Benders decomposition applied to multisource multizone building temperature regulation

Distributed model predictive control based on Benders decomposition applied to multisource multizone building temperature regulation Distributed model predictive control based on Benders decomposition applied to multisource multizone building temperature regulation Petru-Daniel Moroşan, Romain Bourdais, Didier Dumur, Jean Buisson Abstract

More information

Lecture 9: Dantzig-Wolfe Decomposition

Lecture 9: Dantzig-Wolfe Decomposition Lecture 9: Dantzig-Wolfe Decomposition (3 units) Outline Dantzig-Wolfe decomposition Column generation algorithm Relation to Lagrangian dual Branch-and-price method Generated assignment problem and multi-commodity

More information

Lecture Notes on Solving Moral-Hazard Problems Using the Dantzig-Wolfe Algorithm

Lecture Notes on Solving Moral-Hazard Problems Using the Dantzig-Wolfe Algorithm Lecture Notes on Solving Moral-Hazard Problems Using the Dantzig-Wolfe Algorithm Edward Simpson Prescott Prepared for ICE 05, July 2005 1 Outline 1. Why compute? Answer quantitative questions Analyze difficult

More information

The use of shadow price is an example of sensitivity analysis. Duality theory can be applied to do other kind of sensitivity analysis:

The use of shadow price is an example of sensitivity analysis. Duality theory can be applied to do other kind of sensitivity analysis: Sensitivity analysis The use of shadow price is an example of sensitivity analysis. Duality theory can be applied to do other kind of sensitivity analysis: Changing the coefficient of a nonbasic variable

More information

Technical work in WP2 and WP5

Technical work in WP2 and WP5 Technical work in WP2 and WP5 UNIZG-FER Mato Baotić, Branimir Novoselnik, Jadranko Matuško, Mario Vašak, Andrej Jokić Aachen, October 9, 2015 This project has received funding from the European Union s

More information

Simplex Algorithm Using Canonical Tableaus

Simplex Algorithm Using Canonical Tableaus 41 Simplex Algorithm Using Canonical Tableaus Consider LP in standard form: Min z = cx + α subject to Ax = b where A m n has rank m and α is a constant In tableau form we record it as below Original Tableau

More information

SOLVING INTEGER LINEAR PROGRAMS. 1. Solving the LP relaxation. 2. How to deal with fractional solutions?

SOLVING INTEGER LINEAR PROGRAMS. 1. Solving the LP relaxation. 2. How to deal with fractional solutions? SOLVING INTEGER LINEAR PROGRAMS 1. Solving the LP relaxation. 2. How to deal with fractional solutions? Integer Linear Program: Example max x 1 2x 2 0.5x 3 0.2x 4 x 5 +0.6x 6 s.t. x 1 +2x 2 1 x 1 + x 2

More information

The Primal-Dual Algorithm P&S Chapter 5 Last Revised October 30, 2006

The Primal-Dual Algorithm P&S Chapter 5 Last Revised October 30, 2006 The Primal-Dual Algorithm P&S Chapter 5 Last Revised October 30, 2006 1 Simplex solves LP by starting at a Basic Feasible Solution (BFS) and moving from BFS to BFS, always improving the objective function,

More information

Improvements to Benders' decomposition: systematic classification and performance comparison in a Transmission Expansion Planning problem

Improvements to Benders' decomposition: systematic classification and performance comparison in a Transmission Expansion Planning problem Improvements to Benders' decomposition: systematic classification and performance comparison in a Transmission Expansion Planning problem Sara Lumbreras & Andrés Ramos July 2013 Agenda Motivation improvement

More information

Accelerating interior point methods with GPUs for smart grid systems

Accelerating interior point methods with GPUs for smart grid systems Downloaded from orbit.dtu.dk on: Dec 18, 2017 Accelerating interior point methods with GPUs for smart grid systems Gade-Nielsen, Nicolai Fog Publication date: 2011 Document Version Publisher's PDF, also

More information

56:270 Final Exam - May

56:270  Final Exam - May @ @ 56:270 Linear Programming @ @ Final Exam - May 4, 1989 @ @ @ @ @ @ @ @ @ @ @ @ @ @ Select any 7 of the 9 problems below: (1.) ANALYSIS OF MPSX OUTPUT: Please refer to the attached materials on the

More information

HPMPC - A new software package with efficient solvers for Model Predictive Control

HPMPC - A new software package with efficient solvers for Model Predictive Control - A new software package with efficient solvers for Model Predictive Control Technical University of Denmark CITIES Second General Consortium Meeting, DTU, Lyngby Campus, 26-27 May 2015 Introduction Model

More information

Nonconvex Generalized Benders Decomposition Paul I. Barton

Nonconvex Generalized Benders Decomposition Paul I. Barton Nonconvex Generalized Benders Decomposition Paul I. Barton Process Systems Engineering Laboratory Massachusetts Institute of Technology Motivation Two-stage Stochastic MINLPs & MILPs Natural Gas Production

More information

Decomposition-based Methods for Large-scale Discrete Optimization p.1

Decomposition-based Methods for Large-scale Discrete Optimization p.1 Decomposition-based Methods for Large-scale Discrete Optimization Matthew V Galati Ted K Ralphs Department of Industrial and Systems Engineering Lehigh University, Bethlehem, PA, USA Départment de Mathématiques

More information

Introduction to Integer Programming

Introduction to Integer Programming Lecture 3/3/2006 p. /27 Introduction to Integer Programming Leo Liberti LIX, École Polytechnique liberti@lix.polytechnique.fr Lecture 3/3/2006 p. 2/27 Contents IP formulations and examples Total unimodularity

More information

Practical Implementations of Advanced Process Control for Linear Systems

Practical Implementations of Advanced Process Control for Linear Systems Downloaded from orbitdtudk on: Jul 01, 2018 Practical Implementations of Advanced Process Control for Linear Systems Knudsen, Jørgen K H ; Huusom, Jakob Kjøbsted; Jørgensen, John Bagterp Published in:

More information

Perfect and Imperfect Competition in Electricity Markets

Perfect 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 information

Simplex tableau CE 377K. April 2, 2015

Simplex tableau CE 377K. April 2, 2015 CE 377K April 2, 2015 Review Reduced costs Basic and nonbasic variables OUTLINE Review by example: simplex method demonstration Outline Example You own a small firm producing construction materials for

More information

Primal/Dual Decomposition Methods

Primal/Dual Decomposition Methods Primal/Dual Decomposition Methods Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization Fall 2018-19, HKUST, Hong Kong Outline of Lecture Subgradients

More information

Large-scale optimization and decomposition methods: outline. Column Generation and Cutting Plane methods: a unified view

Large-scale optimization and decomposition methods: outline. Column Generation and Cutting Plane methods: a unified view Large-scale optimization and decomposition methods: outline I Solution approaches for large-scaled problems: I Delayed column generation I Cutting plane methods (delayed constraint generation) 7 I Problems

More information

Network Flows. 6. Lagrangian Relaxation. Programming. Fall 2010 Instructor: Dr. Masoud Yaghini

Network Flows. 6. Lagrangian Relaxation. Programming. Fall 2010 Instructor: Dr. Masoud Yaghini In the name of God Network Flows 6. Lagrangian Relaxation 6.3 Lagrangian Relaxation and Integer Programming Fall 2010 Instructor: Dr. Masoud Yaghini Integer Programming Outline Branch-and-Bound Technique

More information

Hot-Starting NLP Solvers

Hot-Starting NLP Solvers Hot-Starting NLP Solvers Andreas Wächter Department of Industrial Engineering and Management Sciences Northwestern University waechter@iems.northwestern.edu 204 Mixed Integer Programming Workshop Ohio

More information

Interior-Point versus Simplex methods for Integer Programming Branch-and-Bound

Interior-Point versus Simplex methods for Integer Programming Branch-and-Bound Interior-Point versus Simplex methods for Integer Programming Branch-and-Bound Samir Elhedhli elhedhli@uwaterloo.ca Department of Management Sciences, University of Waterloo, Canada Page of 4 McMaster

More information

Optimal Demand Response

Optimal Demand Response Optimal Demand Response Libin Jiang Steven Low Computing + Math Sciences Electrical Engineering Caltech June 2011 Outline o Motivation o Demand response model o Some results Wind power over land (outside

More information

Optimal Demand Response

Optimal Demand Response Optimal Demand Response Libin Jiang Steven Low Computing + Math Sciences Electrical Engineering Caltech Oct 2011 Outline Caltech smart grid research Optimal demand response Global trends 1 Exploding renewables

More information

EVALUATION OF WIND ENERGY SOURCES INFLUENCE ON COMPOSITE GENERATION AND TRANSMISSION SYSTEMS RELIABILITY

EVALUATION OF WIND ENERGY SOURCES INFLUENCE ON COMPOSITE GENERATION AND TRANSMISSION SYSTEMS RELIABILITY EVALUATION OF WIND ENERGY SOURCES INFLUENCE ON COMPOSITE GENERATION AND TRANSMISSION SYSTEMS RELIABILITY Carmen Lucia Tancredo Borges João Paulo Galvão carmen@dee.ufrj.br joaopaulo@mercados.com.br Federal

More information

The L-Shaped Method. Operations Research. Anthony Papavasiliou 1 / 44

The L-Shaped Method. Operations Research. Anthony Papavasiliou 1 / 44 1 / 44 The L-Shaped Method Operations Research Anthony Papavasiliou Contents 2 / 44 1 The L-Shaped Method [ 5.1 of BL] 2 Optimality Cuts [ 5.1a of BL] 3 Feasibility Cuts [ 5.1b of BL] 4 Proof of Convergence

More information

Decomposition Techniques in Mathematical Programming

Decomposition Techniques in Mathematical Programming Antonio J. Conejo Enrique Castillo Roberto Minguez Raquel Garcia-Bertrand Decomposition Techniques in Mathematical Programming Engineering and Science Applications Springer Contents Part I Motivation and

More information

Benders Decomposition

Benders Decomposition Benders Decomposition Yuping Huang, Dr. Qipeng Phil Zheng Department of Industrial and Management Systems Engineering West Virginia University IENG 593G Nonlinear Programg, Spring 2012 Yuping Huang (IMSE@WVU)

More information

Classification of Dantzig-Wolfe Reformulations for MIP s

Classification of Dantzig-Wolfe Reformulations for MIP s Classification of Dantzig-Wolfe Reformulations for MIP s Raf Jans Rotterdam School of Management HEC Montreal Workshop on Column Generation Aussois, June 2008 Outline and Motivation Dantzig-Wolfe reformulation

More information

CO350 Linear Programming Chapter 6: The Simplex Method

CO350 Linear Programming Chapter 6: The Simplex Method CO350 Linear Programming Chapter 6: The Simplex Method 8th June 2005 Chapter 6: The Simplex Method 1 Minimization Problem ( 6.5) We can solve minimization problems by transforming it into a maximization

More information

Part 1. The Review of Linear Programming

Part 1. The Review of Linear Programming In the name of God Part 1. The Review of Linear Programming 1.5. Spring 2010 Instructor: Dr. Masoud Yaghini Outline Introduction Formulation of the Dual Problem Primal-Dual Relationship Economic Interpretation

More information

Part 1. The Review of Linear Programming

Part 1. The Review of Linear Programming In the name of God Part 1. The Review of Linear Programming 1.2. Spring 2010 Instructor: Dr. Masoud Yaghini Outline Introduction Basic Feasible Solutions Key to the Algebra of the The Simplex Algorithm

More information

A Decomposition Based Approach for Solving a General Bilevel Linear Programming

A Decomposition Based Approach for Solving a General Bilevel Linear Programming A Decomposition Based Approach for Solving a General Bilevel Linear Programming Xuan Liu, Member, IEEE, Zuyi Li, Senior Member, IEEE Abstract Bilevel optimization has been widely used in decisionmaking

More information

The Simplex and Policy Iteration Methods are Strongly Polynomial for the Markov Decision Problem with Fixed Discount

The Simplex and Policy Iteration Methods are Strongly Polynomial for the Markov Decision Problem with Fixed Discount The Simplex and Policy Iteration Methods are Strongly Polynomial for the Markov Decision Problem with Fixed Discount Yinyu Ye Department of Management Science and Engineering and Institute of Computational

More information

Multi-terminal Offshore Grid for the North Sea Region for 2030 and 2050 Scenarios

Multi-terminal Offshore Grid for the North Sea Region for 2030 and 2050 Scenarios Downloaded from orbit.dtu.dk on: Jul 25, 2018 Multi-terminal Offshore Grid for the North Sea Region for 2030 and 2050 Scenarios Koivisto, Matti Juhani; Sørensen, Poul Ejnar; Maule, Petr; Traber, Thure

More information

Decentralized Formation Control including Collision Avoidance

Decentralized Formation Control including Collision Avoidance Decentralized Formation Control including Collision Avoidance Nopthawat Kitudomrat Fujita Lab Dept. of Mechanical and Control Engineering Tokyo Institute of Technology FL07-16-1 Seminar 01/10/2007 1 /

More information

Predicting the Electricity Demand Response via Data-driven Inverse Optimization

Predicting 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 information

Lecture 5 Simplex Method. September 2, 2009

Lecture 5 Simplex Method. September 2, 2009 Simplex Method September 2, 2009 Outline: Lecture 5 Re-cap blind search Simplex method in steps Simplex tableau Operations Research Methods 1 Determining an optimal solution by exhaustive search Lecture

More information

Review Solutions, Exam 2, Operations Research

Review Solutions, Exam 2, Operations Research Review Solutions, Exam 2, Operations Research 1. Prove the weak duality theorem: For any x feasible for the primal and y feasible for the dual, then... HINT: Consider the quantity y T Ax. SOLUTION: To

More information

Stochastic Unit Commitment with Topology Control Recourse for Renewables Integration

Stochastic 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 information

An Adaptive Partition-based Approach for Solving Two-stage Stochastic Programs with Fixed Recourse

An Adaptive Partition-based Approach for Solving Two-stage Stochastic Programs with Fixed Recourse An Adaptive Partition-based Approach for Solving Two-stage Stochastic Programs with Fixed Recourse Yongjia Song, James Luedtke Virginia Commonwealth University, Richmond, VA, ysong3@vcu.edu University

More information

A Benders Decomposition Approach to Corrective Security Constrained OPF with Power Flow Control Devices

A Benders Decomposition Approach to Corrective Security Constrained OPF with Power Flow Control Devices A Benders Decomposition Approach to Corrective Security Constrained OPF with Power Flow Control Devices Javad Mohammadi, Gabriela Hug, Soummya Kar Department of Electrical and Computer Engineering Carnegie

More information

The Simplex Method. Standard form (max) z c T x = 0 such that Ax = b.

The Simplex Method. Standard form (max) z c T x = 0 such that Ax = b. The Simplex Method Standard form (max) z c T x = 0 such that Ax = b. The Simplex Method Standard form (max) z c T x = 0 such that Ax = b. Build initial tableau. z c T 0 0 A b The Simplex Method Standard

More information

Multiple Criteria Optimization: Some Introductory Topics

Multiple Criteria Optimization: Some Introductory Topics Multiple Criteria Optimization: Some Introductory Topics Ralph E. Steuer Department of Banking & Finance University of Georgia Athens, Georgia 30602-6253 USA Finland 2010 1 rsteuer@uga.edu Finland 2010

More information

Temporal-Difference Q-learning in Active Fault Diagnosis

Temporal-Difference Q-learning in Active Fault Diagnosis Temporal-Difference Q-learning in Active Fault Diagnosis Jan Škach 1 Ivo Punčochář 1 Frank L. Lewis 2 1 Identification and Decision Making Research Group (IDM) European Centre of Excellence - NTIS University

More information

OPERATIONS RESEARCH. Linear Programming Problem

OPERATIONS RESEARCH. Linear Programming Problem OPERATIONS RESEARCH Chapter 1 Linear Programming Problem Prof. Bibhas C. Giri Department of Mathematics Jadavpur University Kolkata, India Email: bcgiri.jumath@gmail.com MODULE - 2: Simplex Method for

More information

Novel update techniques for the revised simplex method (and their application)

Novel update techniques for the revised simplex method (and their application) Novel update techniques for the revised simplex method (and their application) Qi Huangfu 1 Julian Hall 2 Others 1 FICO 2 School of Mathematics, University of Edinburgh ERGO 30 November 2016 Overview Background

More information

A Trust-region-based Sequential Quadratic Programming Algorithm

A Trust-region-based Sequential Quadratic Programming Algorithm Downloaded from orbit.dtu.dk on: Oct 19, 2018 A Trust-region-based Sequential Quadratic Programming Algorithm Henriksen, Lars Christian; Poulsen, Niels Kjølstad Publication date: 2010 Document Version

More information

Weighted Acyclic Di-Graph Partitioning by Balanced Disjoint Paths

Weighted Acyclic Di-Graph Partitioning by Balanced Disjoint Paths Weighted Acyclic Di-Graph Partitioning by Balanced Disjoint Paths H. Murat AFSAR Olivier BRIANT Murat.Afsar@g-scop.inpg.fr Olivier.Briant@g-scop.inpg.fr G-SCOP Laboratory Grenoble Institute of Technology

More information

Integer Programming. Wolfram Wiesemann. December 6, 2007

Integer Programming. Wolfram Wiesemann. December 6, 2007 Integer Programming Wolfram Wiesemann December 6, 2007 Contents of this Lecture Revision: Mixed Integer Programming Problems Branch & Bound Algorithms: The Big Picture Solving MIP s: Complete Enumeration

More information

Online monitoring of MPC disturbance models using closed-loop data

Online monitoring of MPC disturbance models using closed-loop data Online monitoring of MPC disturbance models using closed-loop data Brian J. Odelson and James B. Rawlings Department of Chemical Engineering University of Wisconsin-Madison Online Optimization Based Identification

More information

Pedro Munari - COA 2017, February 10th, University of Edinburgh, Scotland, UK 2

Pedro Munari - COA 2017, February 10th, University of Edinburgh, Scotland, UK 2 Pedro Munari [munari@dep.ufscar.br] - COA 2017, February 10th, University of Edinburgh, Scotland, UK 2 Outline Vehicle routing problem; How interior point methods can help; Interior point branch-price-and-cut:

More information

Stabilization in Column Generation: numerical study

Stabilization in Column Generation: numerical study 1 / 26 Stabilization in Column Generation: numerical study Artur Pessoa 3 Ruslan Sadykov 1,2 Eduardo Uchoa 3 François Vanderbeck 2,1 1 INRIA Bordeaux, France 2 Univ. Bordeaux I, France 3 Universidade Federal

More information

Congestion Management in a Smart Grid via Shadow Prices

Congestion 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 information

Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse

Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse Merve Bodur 1, Sanjeeb Dash 2, Otay Günlü 2, and James Luedte 3 1 Department of Mechanical and Industrial Engineering,

More information

Multiobjective Mixed-Integer Stackelberg Games

Multiobjective Mixed-Integer Stackelberg Games Solving the Multiobjective Mixed-Integer SCOTT DENEGRE TED RALPHS ISE Department COR@L Lab Lehigh University tkralphs@lehigh.edu EURO XXI, Reykjavic, Iceland July 3, 2006 Outline Solving the 1 General

More information

Lagrangian Relaxation in MIP

Lagrangian Relaxation in MIP Lagrangian Relaxation in MIP Bernard Gendron May 28, 2016 Master Class on Decomposition, CPAIOR2016, Banff, Canada CIRRELT and Département d informatique et de recherche opérationnelle, Université de Montréal,

More information

Optimal Power Flow. S. Bose, M. Chandy, M. Farivar, D. Gayme S. Low. C. Clarke. Southern California Edison. Caltech. March 2012

Optimal Power Flow. S. Bose, M. Chandy, M. Farivar, D. Gayme S. Low. C. Clarke. Southern California Edison. Caltech. March 2012 Optimal Power Flow over Radial Networks S. Bose, M. Chandy, M. Farivar, D. Gayme S. Low Caltech C. Clarke Southern California Edison March 2012 Outline Motivation Semidefinite relaxation Bus injection

More information

Alternative Decompositions for Distributed Maximization of Network Utility: Framework and Applications

Alternative Decompositions for Distributed Maximization of Network Utility: Framework and Applications Alternative Decompositions for Distributed Maximization of Network Utility: Framework and Applications Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization

More information

An Integer Cutting-Plane Procedure for the Dantzig-Wolfe Decomposition: Theory

An Integer Cutting-Plane Procedure for the Dantzig-Wolfe Decomposition: Theory An Integer Cutting-Plane Procedure for the Dantzig-Wolfe Decomposition: Theory by Troels Martin Range Discussion Papers on Business and Economics No. 10/2006 FURTHER INFORMATION Department of Business

More information

Robustness Adjustment of Two-Stage Robust Security-Constrained Unit Commitment

Robustness Adjustment of Two-Stage Robust Security-Constrained Unit Commitment Robustness Adjustment of Two-Stage Robust Secury-Constrained Un Commment Ping Liu MISSISSIPPI STATE UNIVERSITY U.S.A October 23, 204 Challenges in smart grid Integration of renewable energy and prediction

More information

Multi-Robotic Systems

Multi-Robotic Systems CHAPTER 9 Multi-Robotic Systems The topic of multi-robotic systems is quite popular now. It is believed that such systems can have the following benefits: Improved performance ( winning by numbers ) Distributed

More information

Cooperation-based optimization of industrial supply chains

Cooperation-based optimization of industrial supply chains Cooperation-based optimization of industrial supply chains James B. Rawlings, Brett T. Stewart, Kaushik Subramanian and Christos T. Maravelias Department of Chemical and Biological Engineering May 9 2,

More information

Multi-Area Stochastic Unit Commitment for High Wind Penetration

Multi-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 information

Column Generation. MTech Seminar Report. Soumitra Pal Roll No: under the guidance of

Column Generation. MTech Seminar Report. Soumitra Pal Roll No: under the guidance of Column Generation MTech Seminar Report by Soumitra Pal Roll No: 05305015 under the guidance of Prof. A. G. Ranade Computer Science and Engineering IIT-Bombay a Department of Computer Science and Engineering

More information

Mediterranean Sea and Territorial Development, Opportunities and Risks

Mediterranean Sea and Territorial Development, Opportunities and Risks EESC Hearing Towards an EU Macro-Regional Strategy for the Mediterranean Mediterranean Sea and Territorial Development, Opportunities and Risks Michaela Gensheimer Structure of Intervention Part I: What

More information

Stochastic Equilibrium Problems arising in the energy industry

Stochastic Equilibrium Problems arising in the energy industry Stochastic Equilibrium Problems arising in the energy industry Claudia Sagastizábal (visiting researcher IMPA) mailto:sagastiz@impa.br http://www.impa.br/~sagastiz ENEC workshop, IPAM, Los Angeles, January

More information

Chapter 3, Operations Research (OR)

Chapter 3, Operations Research (OR) Chapter 3, Operations Research (OR) Kent Andersen February 7, 2007 1 Linear Programs (continued) In the last chapter, we introduced the general form of a linear program, which we denote (P) Minimize Z

More information

Interior Point Methods for LP

Interior Point Methods for LP 11.1 Interior Point Methods for LP Katta G. Murty, IOE 510, LP, U. Of Michigan, Ann Arbor, Winter 1997. Simplex Method - A Boundary Method: Starting at an extreme point of the feasible set, the simplex

More information