Linear Programming and Applications

Slides:



Advertisements
Similar presentations
Lesson 08 Linear Programming
Advertisements

Linear Programming Problem
Water Resources Planning and Management Daene C. McKinney
Session II – Introduction to Linear Programming
Department of Civil Engineering, I.T.U
Water Resources Planning and Management Daene C. McKinney Optimization.
CVEN 5838 Aug 28, 2008 Lecture 2 Reservoir Capacity Yield Analysis (how to size a reservoir and measure its performance)
Water Resources Planning and Management Daene C. McKinney River Basin Modeling.
Operation Research Chapter 3 Simplex Method.
Long Term Storage Long term storage means to store water during high inflows years for the benefit of low inflows years. Long term storage means to store.
Introduction to Management Science
6s-1Linear Programming CHAPTER 6s Linear Programming.
To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved by Prentice-Hall, Inc1  Model.
Linear Programming Applications
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
D Nagesh Kumar, IIScOptimization Methods: M3L1 1 Linear Programming Preliminaries.
Review of Reservoir Problem OR753 October 29, 2014 Remote Sensing and GISc, IST.
Linear Programming Applications
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Water Resources Planning and Management Daene C. McKinney Simulating System Performance.
Dr. David Ahlfeld Professor of Civil and Environmental Engineering The Westfield River Basin Optimization Model Demonstration:
Chapter 19 Linear Programming McGraw-Hill/Irwin
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 6S Linear Programming.
Copyright © 2008 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin 12 Financial and Cost- Volume-Profit Models.
ESET ALEMU WEST Consultants, Inc. Bellevue, Washington.
Water Supply Reallocation Workshop Determining Yield and Space Requirement.
Linear Programming An Example. Problem The dairy "Fior di Latte" produces two types of cheese: cheese A and B. The dairy company must decide how many.
Introduction A GENERAL MODEL OF SYSTEM OPTIMIZATION.
Hydro Power 102. Hydroelectric Models in the Northwest.
DISTRIBUTION AND NETWORK MODELS (1/2)
D Nagesh Kumar, IIScOptimization Methods: M3L2 1 Linear Programming Graphical method.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
D Nagesh Kumar, IIScOptimization Methods: M2L4 1 Optimization using Calculus Optimization of Functions of Multiple Variables subject to Equality Constraints.
D Nagesh Kumar, IIScOptimization Methods: M4L4 1 Linear Programming Applications Structural & Water Resources Problems.
Introduction to Basic Inventory Control Theory
D Nagesh Kumar, IIScOptimization Methods: M6L5 1 Dynamic Programming Applications Capacity Expansion.
Reservoir Operation Simulation D Nagesh Kumar, IISc Water Resources Planning and Management: M7L2 Simulation.
(iii) Lagrange Multipliers and Kuhn-tucker Conditions D Nagesh Kumar, IISc Introduction to Optimization Water Resources Systems Planning and Management:
OASIS Basics Computer Aided Negotiations of Water Resources Disputes.
Floodplain Management D Nagesh Kumar, IISc Water Resources Planning and Management: M8L5 Water Resources Systems Modeling.
Fuzzy Optimization D Nagesh Kumar, IISc Water Resources Planning and Management: M9L1 Advanced Topics.
Multi-objective Optimization
Linear Programming and Applications
Water Resources System Modeling
Stochastic Optimization
Water Resources Planning and Management
Multi-objective Optimization
Introduction to Optimization
Linear Programming Water Resources Planning and Management Daene McKinney.
(i) Preliminaries D Nagesh Kumar, IISc Water Resources Planning and Management: M3L1 Linear Programming and Applications.
Transportation Problems Joko Waluyo, Ir., MT., PhD Dept. of Mechanical and Industrial Engineering.
Urban Stormwater Management D Nagesh Kumar, IISc Water Resources Planning and Management: M8L6 Water Resources Systems Modeling.
Introduction and River Basin Simulation D Nagesh Kumar, IISc Water Resources Planning and Management: M7L1 Simulation.
Stochastic Processes and Transition Probabilities D Nagesh Kumar, IISc Water Resources Planning and Management: M6L5 Stochastic Optimization.
Uncertainty and Reliability Analysis D Nagesh Kumar, IISc Water Resources Planning and Management: M6L2 Stochastic Optimization.
Water Resources Planning and Management Daene C. McKinney System Performance Indicators.
D Nagesh Kumar, IIScOptimization Methods: M8L6 1 Advanced Topics in Optimization Applications in Civil Engineering.
Groundwater Systems D Nagesh Kumar, IISc Water Resources Planning and Management: M8L3 Water Resources System Modeling.
Introduction and Preliminaries D Nagesh Kumar, IISc Water Resources Planning and Management: M4L1 Dynamic Programming and Applications.
D Nagesh Kumar, IISc Water Resources Systems Planning and Management: M2L2 Introduction to Optimization (ii) Constrained and Unconstrained Optimization.
(iii) Simplex method - I D Nagesh Kumar, IISc Water Resources Planning and Management: M3L3 Linear Programming and Applications.
6s-1Linear Programming William J. Stevenson Operations Management 8 th edition.
Operations Research.  Operations Research (OR) aims to having the optimization solution for some administrative problems, such as transportation, decision-making,
Engineering Economics (2+0)
Water Resources Planning and Management Daene McKinney
Stochastic Optimization
Special Cases In Linear Programming
Linear Programming Dr. T. T. Kachwala.
Dynamic Programming and Applications
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Presentation transcript:

Linear Programming and Applications (vi) Reservoir Operation and Reservoir Sizing using LP Water Resources Planning and Management: M3L6 D Nagesh Kumar, IISc

Objectives To formulate reservoir operation problem in the form of LPP To formulate reservoir sizing problem in the form of LPP Water Resources Systems Planning and Management: M3L6 D Nagesh Kumar, IISc

Reservoir Operation Reservoir operation policies - Enable the operator to take appropriate decision Reservoir operation policy indicates the amount of water to be released based on the state of the reservoir, demands and the likely inflow to the reservoir The release from a single purpose reservoir can be done with the objective of maximizing the benefits For multi-purpose reservoirs, there is a need to optimally allocate the releases among purposes The simplest of the operation policies is the standard operation policy (SOP) Water Resources Systems Planning and Management: M2L1 D Nagesh Kumar, IISc

Standard Operating Policy The standard operating policy (SOP) aims to meet the demand to the maximum extent in each period based on the water availability in that period. According to SOP, if the water available (storage, St+ inflow, It) at a particular period is less than the demand Dt, then all the available water is released If the available water is more than the demand but less than demand + storage capacity K, then release is equal to the demand. If after releasing the demands, there is no space for extra water, then the excess water is also released Water Resources Systems Planning and Management: M2L1 D Nagesh Kumar, IISc

Standard Operating Policy… Along OA: Release = water available; reservoir will be empty after release. Along AB: Release = demand; excess water is stored in the reservoir (filling phase). At A: Reservoir is empty after release. At B: Reservoir is full after release. Along BC: Release = demand + excess of availability over the capacity (spill) The releases according to the SOP need not be optimum Graphical representation of SOP D Release D + K Available water = Storage + Inflow 450 O A C B No insight about the scenarios of the future periods in a year The releases according to the SOP need not be optimum Water Resources Systems Planning and Management: M2L1 D Nagesh Kumar, IISc

Derivation of optimal operating policy using LP Consider a reservoir of capacity K. Optimization problem: To determine the releases Rt that optimize an objective function satisfying all the constraints. Objective function can be a function of storage volume or release. Typical constraints in a reservoir optimization model: Conservation of mass and other hydrological and hydraulic constraints Minimum and maximum storage and release Hydropower and water requirements Hydropower generation limits Inflow, It Evaporation, EVt Storage, St Release (irrigation+ water supply), Rt Single reservoir operation Water Resources Systems Planning and Management: M2L1 D Nagesh Kumar, IISc

Derivation of optimal operating policy using LP… Consider the objective of meeting the demands to the extent possible i.e., maximizing the releases. The optimization model can be formulated as: Maximize Subject to Hydraulic constraints as defined by the reservoir continuity equation St+1 = St + It – EVt - Rt - Ot for all t where Ot is the outflow The constraints for outflow are Ot = 0 if St + It – EVt - Rt ≤ K = K – [St + It – EVt - Rt] if St + It – EVt - Rt > K Water Resources Systems Planning and Management: M2L1 D Nagesh Kumar, IISc

Derivation of optimal operating policy using LP… Reservoir capacity St ≤ K – Kd for all t, where Kd is the dead storage or simply St ≤ K St ≥ 0 for all t. Target demand Rt ≤ Dt for all t. Rt ≥ 0 for all t. Large LP problems can be solved very efficiently using LINGO - Language for INteractive General Optimization, LINDO Systems Inc, USA Water Resources Systems Planning and Management: M2L1 D Nagesh Kumar, IISc

Example Derive an optimal operating policy for a reservoir to meet a long-term objective. Single reservoir operation with deterministic inflows. K = 400. t Inflows Evaporation Demand 1 90.7 10 71.5 2 450.6 8 140.5 3 380.4 4 153.2 80.6 5 120 6 30.6 55 240.6 7 29.06 241.7 24.27 190.5 9 30.87 98.1 15.9 11 12.8 12 Water Resources Systems Planning and Management: M2L1 D Nagesh Kumar, IISc

Example… Solution Objective function: Maximize Subject to St+1 = St + It – EVt - Rt - Ot for t = 1, 2, …, 12 where Ot is the outflow Ot = 0 if St + It – EVt - Rt ≤ K = K – [St + It – EVt - Rt] if St + It – EVt - Rt > K St ≤ 400 ; St ≥ 0; Rt ≤ Dt ; Rt ≥ 0 for t = 1, 2, …, 12 Water Resources Systems Planning and Management: M2L1 D Nagesh Kumar, IISc

Example… The problem is solved using LINGO and the solution is t St It Rt EVt St+1 Ot 1 17.6 90.7 71.5 10 26.8 2 450.6 140.5 8 328.9 3 380.4 400 160.8 4 153.2 80.6 64.6 5 120 30.6 6 83.4 55 240.6 208.4 7 29.06 241.7 232.21 0.25 24.27 190.5 18.27 9 30.87 98.1 25.12 15.9 7.9 11 12.8 11.7 12 Water Resources Systems Planning and Management: M2L1 D Nagesh Kumar, IISc

Example… Rule curve derived is shown below: Water Resources Systems Planning and Management: M2L1 D Nagesh Kumar, IISc

Reservoir Sizing In many situations, annual demand may be less than the total inflow to a particular site. However, the time distribution of demand and inflows may not match Surplus in some periods and deficit in some other periods Hence, there is a need of storage structure i.e., reservoir to store water in periods of excess flow and make it available when there is a deficit. In order to enable regulation of the storage to best meet the specified demands, the reservoir storage capacity should be enough. Water Resources Systems Planning and Management: M2L1 D Nagesh Kumar, IISc

Reservoir sizing… The problem of reservoir sizing involves determination of the required storage capacity of the reservoir when inflows and demands in a sequence of periods are given. Reservoir capacity can be determined using two methods: Mass diagram method Sequent peak algorithm method Water Resources Systems Planning and Management: M2L1 D Nagesh Kumar, IISc

Mass diagram method Developed by W. Rippl (1883) Mass curve: Plot of the cumulative flow volumes as a function of time. Mass curve analysis - Graphical method called Ripple’s method It involves finding the maximum positive cumulative difference between a sequence of pre-specified (desired) reservoir releases Rt and known inflows Qt. One can visualize this as starting with a full reservoir, and going through a sequence of simulations in which the inflows and releases are added and subtracted from that initial storage volume value. Doing this over two cycles of the record of inflows will identify the maximum deficit volume associated with those inflows and releases. This is the required reservoir storage. Water Resources Systems Planning and Management: M2L1 D Nagesh Kumar, IISc

Mass diagram method… Typical mass curve Release rate Cumulative inflow Time, t Cumulative inflow Release rate Typical mass curve Water Resources Systems Planning and Management: M2L1 D Nagesh Kumar, IISc

Sequent Peak Algorithm Computes the cumulative sum of differences between the inflows and reservoir releases for all periods t over the time interval [0, T]. Let Kt be the maximum total storage requirement needed for periods 1 through period t and Rt be the required release in period t, and Qt be the inflow in that period Setting K0 equal to 0, the procedure involves calculating Kt using equation below for up to twice the total length of record. Algebraically, The maximum of all Kt is the required storage capacity for the specified releases Rt and inflows, Qt. Water Resources Systems Planning and Management: M2L1 D Nagesh Kumar, IISc

Formulation of reservoir sizing using LP Linear Programming can be used to obtain reservoir capacity more elegantly by considering variable demands and evaporation rates. The optimization problem is Minimize Ka where Ka is the active storage capacity Subject to Reservoir continuity equation St+1 = St + It – EVt - Rt - Ot for all t Reservoir capacity St ≤ Ka for all t ST+1 = St where T is the last period. Target demands Rt ≥ Dt for all t. Water Resources Systems Planning and Management: M2L1 D Nagesh Kumar, IISc

Storage Yield A complementary problem to reservoir capacity estimation can be done by maximizing the yield. Firm yield is the constant (or largest) quantity of flow that can be released at all times. It is the flow magnitude that is equaled or exceeded 100% of time for a historical sequence of flows. Linear Programming can be used to maximize the yield, R (per period) from a reservoir of given capacity, K. Water Resources Systems Planning and Management: M2L1 D Nagesh Kumar, IISc

Storage Yield The optimization problem can be stated as: Maximize R Subject to Storage continuity equation St+1 = St + It – EVt - Rt - Ot for all t Reservoir capacity St ≤ Ka for all t ST+1 = St where T is the last period. Water Resources Systems Planning and Management: M2L1 D Nagesh Kumar, IISc

Bibliography / Further Reading Dennis T.L. and L.B. Dennis, Microcomputer Models for Management Decision Making, West Publishing Company, 1993. Loucks, D.P., J.R. Stedinger, and D.A. Haith, Water Resources Systems Planning and Analysis, Prentice-Hall, N.J., 1981. Mays, L.W. and K. Tung, Hydrosystems Engineering and Management, Water Resources Publication, 2002. Rao S.S., Engineering Optimization – Theory and Practice, Fourth Edition, John Wiley and Sons, 2009. Taha H.A., Operations Research – An Introduction, 8th edition, Pearson Education India, 2008. Vedula S., and P.P. Mujumdar, Water Resources Systems: Modelling Techniques and Analysis, Tata McGraw Hill, New Delhi, 2005. Rippl., W., The capacity of storage reservoirs for water supply, Proceedings of the Institution of Civil Engineers, 71:270 – 278. Water Resources Systems Planning and Management: M2L3 D Nagesh Kumar, IISc

Thank You Water Resources Systems Planning and Management: M3L6 D. Nagesh Kumar, IISc