Water resources planning and management by use of generalized Benders decomposition method to solve large-scale MINLP problems By Prof. André A. Keller.

Slides:



Advertisements
Similar presentations
1 LP Duality Lecture 13: Feb Min-Max Theorems In bipartite graph, Maximum matching = Minimum Vertex Cover In every graph, Maximum Flow = Minimum.
Advertisements

Electrical and Computer Engineering Mississippi State University
1 Department of Business Administration SPRING Management Science by Asst. Prof. Sami Fethi © 2007 Pearson Education.
Water Resources Development and Management Optimization (Integer Programming) CVEN 5393 Mar 11, 2013.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Introduction to Linear and Integer Programming
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Water Resources Systems Modeling for Planning and Management An Introduction to the Development and Application of Optimization and Simulation Models for.
1 Logic-Based Methods for Global Optimization J. N. Hooker Carnegie Mellon University, USA November 2003.
A Combinatorial Maximum Cover Approach to 2D Translational Geometric Covering Karen Daniels, Arti Mathur, Roger Grinde University of Massachusetts Lowell.
Approximation Algorithms
Supply Chain Design Problem Tuukka Puranen Postgraduate Seminar in Information Technology Wednesday, March 26, 2009.
Solving the Protein Threading Problem in Parallel Nocola Yanev, Rumen Andonov Indrajit Bhattacharya CMSC 838T Presentation.
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley Asynchronous Distributed Algorithm Proof.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
Review of Reservoir Problem OR753 October 29, 2014 Remote Sensing and GISc, IST.
LINEAR PROGRAMMING PROBLEM Definition and Examples.
LP formulation of Economic Dispatch
Integer programming Branch & bound algorithm ( B&B )
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Column Generation Approach for Operating Rooms Planning Mehdi LAMIRI, Xiaolan XIE and ZHANG Shuguang Industrial Engineering and Computer Sciences Division.
Optimization for Operation of Power Systems with Performance Guarantee
1 Hyong-Mo Jeon Reliability Models for Facility Location with Risk Pooling ISE 2004 Summer IP Seminar Jul
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Types of IP Models All-integer linear programs Mixed integer linear programs (MILP) Binary integer linear programs, mixed or all integer: some or all of.
1 Optimization Based Power Generation Scheduling Xiaohong Guan Tsinghua / Xian Jiaotong University.
MILP algorithms: branch-and-bound and branch-and-cut
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 11-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 11.
Professor: Chu, Ta Chung Student: Nguyen Quang Tung Student’s ID: M977Z235 Fuzzy multiobjective linear model for supplier selection in a supply chain.
1 Lagrangean Relaxation --- Bounding through penalty adjustment.
1 Outline:  Optimization of Timed Systems  TA-Modeling of Scheduling Tasks  Transformation of TA into Mixed-Integer Programs  Tree Search for TA using.
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley.
Integer Programming Li Xiaolei. Introduction to Integer Programming An IP in which all variables are required to be integers is called a pure integer.
The Method of Moving Asymptotes
Approximation Algorithms Department of Mathematics and Computer Science Drexel University.
1/74 Lagrangian Relaxation and Network Optimization Cheng-Ta Lee Department of Information Management National Taiwan University September 29, 2005.
1.2 Guidelines for strong formulations  Running time for LP usually depends on m and n ( number of iterations O(m), O(log n)). Not critically depend on.
1 Attractive Mathematical Representations Of Decision Problems Warren Adams 11/04/03.
Resource Allocation in Hospital Networks Based on Green Cognitive Radios 王冉茵
Multi-objective Optimization
Optimization in Engineering Design 1 Introduction to Non-Linear Optimization.
5.3 Mixed Integer Nonlinear Programming Models. A Typical MINLP Model.
Global Optimization Methods for the Discrete Network Design Problem Dr. Shuaian Wang Lecturer University of Wollongong Dr. Qiang Meng Associate Professor.
IE 312 Review 1. The Process 2 Problem Model Conclusions Problem Formulation Analysis.
Tactical Planning in Healthcare using Approximate Dynamic Programming (tactisch plannen van toegangstijden in de zorg) Peter J.H. Hulshof, Martijn R.K.
DEPARTMENT/SEMESTER ME VII Sem COURSE NAME Operation Research Manav Rachna College of Engg.
OR Integer Programming ( 정수계획법 ). OR
A Two-Phase Linear programming Approach for Redundancy Problems by Yi-Chih HSIEH Department of Industrial Management National Huwei Institute of Technology.
D Nagesh Kumar, IIScOptimization Methods: M8L6 1 Advanced Topics in Optimization Applications in Civil Engineering.
1 Introduction Optimization: Produce best quality of life with the available resources Engineering design optimization: Find the best system that satisfies.
Parametric Quadratic Optimization Oleksandr Romanko Joint work with Alireza Ghaffari Hadigheh and Tamás Terlaky McMaster University January 19, 2004.
Linear Programming Piyush Kumar Welcome to CIS5930.
1 Chapter 6 Reformulation-Linearization Technique and Applications.
1 Chapter 5 Branch-and-bound Framework and Its Applications.
Signal processing and Networking for Big Data Applications: Lecture 9 Mix Integer Programming: Benders decomposition And Branch & Bound NOTE: To change.
5.3 Mixed-Integer Nonlinear Programming (MINLP) Models
6.5 Stochastic Prog. and Benders’ decomposition
EMGT 6412/MATH 6665 Mathematical Programming Spring 2016
5.3 Mixed Integer Nonlinear Programming Models
Chapter 6. Large Scale Optimization
Integer Linear Programming
Planning and Scheduling in Manufacturing and Services
Matteo Fischetti, University of Padova
CONSTRAINT GENERATION (BENDERS DECOMPOSITION)
6.5 Stochastic Prog. and Benders’ decomposition
Dr. Arslan Ornek DETERMINISTIC OPTIMIZATION MODELS
1.2 Guidelines for strong formulations
Chapter 6. Large Scale Optimization
1.2 Guidelines for strong formulations
Linear Constrained Optimization
Presentation transcript:

Water resources planning and management by use of generalized Benders decomposition method to solve large-scale MINLP problems By Prof. André A. Keller (France) Three Gorges Dam

Contents Characteristic features of water resources systems: large- scale systems, particular structures, single/ multiple objectives, real and discrete decision variables, fuzzy/ nonfuzzy environment, inequality/ equality constraints, bounded variables, nonlinearities, discontinuities, nonconvexities, nonlinear dynamics. Optimization routines for large-scale simulation systems: optimization routines in simulation models, mixed-integer nonlinear programming, decomposition methods, branch-and-bound techniques, generalized Benders decomposition, flowchart of the algorithm with illustrative solved numerical example, software packages. Water planning and management problems: water resources systems planning and management, groundwater management, water quality management. Small-size illustrative examples, main features of recent applications to WRS planning and management, groundwater management, and water quality management. Water resources planning and management by André A. Keller (2015)2

references ●[1] A.A. Keller, ‘’Multiple-use water resources management by using fuzzy multi-objective heuristic optimization methods: an overview’’, International Journal of Fuzzy Systems and Advanced Applications, 1 (2014) ●[2] A.A. Keller, ‘’Water resources planning and management by use of generalized Benders decomposition method to solve large-scale MINLP problems’’, Journal of Water Resource and Hydraulic Engineering 4, 1-4 (2015) [3] A.A. Keller, ‘’Convex underestimating relaxation techniques for nonconvex polynomial programming problems: computational overview’’, Journal of the Mechanical Behavior of Materials (De Gruyter, Berlin), in Press, ●[4] A.A. Keller, ‘’Evolutionary Multi-Objective Optimization: Theory and Applications’’, Bentham Science eBooks (in preparation: 2015). Water resources planning and management by André A. Keller (2015)3

1. Main characteristic features of water resources systems ►Large-scale system due to 1) a large number of decision variables; 2) a combinatorial number of alternative solutions. ►Mixed-integer bounded decision variables: e.g. in groundwater management, pumping rates are continuous decision variables and locations of wells are integer decision variables. ►Constrained optimization with single/ multiple objective(s ), equality and inequality constraints: 1) physical objectives, e.g. maximizing irrigation releases, hydropower production, groundwater quality; 2) economic objectives, e.g. maximizing net returns, minimizing costs, investment in water development; 3) physical and economic constraints, e;g. reservoir storage, surface water balance, water supply, demand and costs. ►Uncertainties related to: 1) variability of climate and hydrology e.g. flow streams, rainfalls and temperatures; 2) water quality e.g. random pollution transport; 3) imprecision and lack of data; 4) environmental policy, vagueness of judgment from decision makers (fuzzy character of data and relations). Water resources planning and management by André A. Keller (2015)4

2. Combined algorithms for solving large- scale mixed-integer programming problems 1. Decomposition-based algorithm (GBD) Principle: The procedure consists of a master program with interacting sub-problems. 1) Sub-problems receive a set of simplex multipliers and apply their solutions to the master program. 2) The master problem combines this information to compute new duals. 2. Branch-and-bound enumerative algorithm (B&B) Principle: The procedure consists of two basic operations. 1) at the branching step the feasible space is partiionned in smaller subsets; 2) at the bounding step a lower bound (for a minimization problem) is calculated for each subset. Water resources planning and management by André A. Keller (2015)5

► Mixed-integer nonlinear programming Single objective mixed-integer nonlinear programming (MINLP) [1] Multiobjective mixed-integer nonlinear programming (pMINLP) [2-3] Problem: Minimize one objective function subject to equality and inequality constraints and bounds with real and integer design variables. Problem: Minimize multiple objective functions simultaneously subject to constraints and bounds with real and integer design variables. Method: Iterative decomposition- based algorithm where sub-problems interact with a master problem. Formulation: MINLP problem, ILP (master problem), NLP (sub- problems) Formulation: pMINLP (parametric) problem. Solution: Global optimumSolution: Noninferior solution set Water resources planning and management by André A. Keller (2015)6

► GBD algorithm: ● GBD generates an upper bound and a lower bound of the approximated solution at each iteration. ● It consists of a sequence of NLP sub- problems and of a master ILP problem. NLPs provide upper bounds whereas master IP yields a lower bound to the optimal solution. ● A primal sub-problem corresponds to the original problem with fixed discrete variables. It provides information about the upper bounds and Lagrange multipliers. The master problem is derived from nonlinear duality theory and calculates the next set of lower bounds. ● The sequence of updated upper bounds is nonincreasing and that of lower bounds is nondecreasing. A convergence is attained after a finite number of iterations. Water resources planning and management by André A. Keller (2015)7

►Illustrative example (inspired from Li & Sun, 2006) Water resources planning and management by André A. Keller (2015)8

3. Real-life application to WRSs Water resources planning and management by André A. Keller (2015)9

10 Thank you for your attention !