Water Resources Planning and Management Daene C. McKinney Water Quality.

Slides:



Advertisements
Similar presentations
Mass Transport of Pollutants
Advertisements

Geometry and Theory of LP Standard (Inequality) Primal Problem: Dual Problem:
IEOR 4004 Midterm review (Part II) March 12, 2014.
Understanding optimum solution
Subsurface Fate and Transport of Contaminants
Introduction to Algorithms
Sensitivity Analysis Sensitivity analysis examines how the optimal solution will be impacted by changes in the model coefficients due to uncertainty, error.
SENSITIVITY ANALYSIS.
Linear Programming: Simplex Method and Sensitivity Analysis
Operations Management Linear Programming Module B - Part 2
LP EXAMPLES.
Water Resources Planning and Management Daene C. McKinney Optimization.
Chapter 3 Linear Programming: Sensitivity Analysis and Interpretation of Solution MT 235.
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Three Classic Applications of LP Product Mix at Ponderosa Industrial –Considered limited.
Duality Dual problem Duality Theorem Complementary Slackness
Linear Programming: Fundamentals
6s-1Linear Programming CHAPTER 6s Linear Programming.
1 Linear Programming Using the software that comes with the book.
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Seventh Edition © 2004 Prentice Hall, Inc. All rights reserved. Linear Programming.
3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.
LINEAR PROGRAMMING: THE GRAPHICAL METHOD
Spreadsheet Modeling & Decision Analysis:
Chapter 3 An Introduction to Linear Programming
1 1 Slide LINEAR PROGRAMMING: THE GRAPHICAL METHOD n Linear Programming Problem n Properties of LPs n LP Solutions n Graphical Solution n Introduction.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
3-1 Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.
Linear Programming Chapter 13 Supplement.
Special Conditions in LP Models (sambungan BAB 1)
L20 LP part 6 Homework Review Postoptimality Analysis Summary 1.
Sensitivity Analysis What if there is uncertainly about one or more values in the LP model? 1. Raw material changes, 2. Product demand changes, 3. Stock.
Mathematical Programming Cht. 2, 3, 4, 5, 9, 10.
1 1 Slide © 2005 Thomson/South-Western Slides Prepared by JOHN S. LOUCKS ST. EDWARD’S UNIVERSITY.
Linear Programming: Basic Concepts
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 6S Linear Programming.
Managerial Decision Making and Problem Solving
1 1 Slide Linear Programming (LP) Problem n A mathematical programming problem is one that seeks to maximize an objective function subject to constraints.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 15.
THE GALAXY INDUSTRY PRODUCTION PROBLEM -
1 Chapter 7 Linear Programming. 2 Linear Programming (LP) Problems Both objective function and constraints are linear. Solutions are highly structured.
Chapter 6 Supplement Linear Programming.
Introduction A GENERAL MODEL OF SYSTEM OPTIMIZATION.
To accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Fourth Edition  1996 Addison-Wesley Publishing Company, Inc. All rights.
Chapter 7 Duality and Sensitivity in Linear Programming.
1 The Dual in Linear Programming In LP the solution for the profit- maximizing combination of outputs automatically determines the input amounts that must.
Chapter 2 Introduction to Linear Programming n Linear Programming Problem n Problem Formulation n A Maximization Problem n Graphical Solution Procedure.
 Minimization Problem  First Approach  Introduce the basis variable  To solve minimization problem we simple reverse the rule that is we select the.
EE/Econ 458 Duality J. McCalley.
1 1 Slide © 2005 Thomson/South-Western Simplex-Based Sensitivity Analysis and Duality n Sensitivity Analysis with the Simplex Tableau n Duality.
1 Linear Programming (LP) 線性規劃 - George Dantzig, 1947.
D Nagesh Kumar, IIScOptimization Methods: M4L4 1 Linear Programming Applications Structural & Water Resources Problems.
Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 5 th edition Cliff T. Ragsdale.
Water Quality Modeling D Nagesh Kumar, IISc Water Resources Planning and Management: M8L4 Water Resources System Modeling.
Linear Programming and Applications
LP Examples Solid Waste Management. A SOLID WASTE PROBLEM Landfill Maximum capacity (tons/day) Cost of transfer to landfill ($/ton) Cost of disposal at.
Linear Programming Water Resources Planning and Management Daene McKinney.
Linear Programming Short-run decision making model –Optimizing technique –Purely mathematical Product prices and input prices fixed Multi-product production.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming Chapter 2.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
Chitsan Lin, Sheng-Yu Chen Department of Marine Environmental Engineering, National Kaohsiung Marine University, Kaohsiung 81157, Taiwan / 05 / 25.
Operations Research By: Saeed Yaghoubi 1 Graphical Analysis 2.
-114- HMP654/EXECMAS Linear Programming Linear programming is a mathematical technique that allows the decision maker to allocate scarce resources in such.
1 Geometrical solution of Linear Programming Model.
1 Simplex algorithm. 2 The Aim of Linear Programming A Linear Programming model seeks to maximize or minimize a linear function, subject to a set of linear.
6s-1Linear Programming William J. Stevenson Operations Management 8 th edition.
Dissolved oxygen (DO) in the streams
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
ENGM 631 Optimization Ch. 4: Solving Linear Programs: The Simplex Method.
Lecture 4 Part I Mohamed A. M. A..
Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.
Presentation transcript:

Water Resources Planning and Management Daene C. McKinney Water Quality

Water Quality Management Critical component of overall water management in a basin Water bodies serve many uses, including – Transport and assimilation of wastes – Assimilative capacities of water bodies can be exceeded WRT intended uses Water quality management measures – Standards Minimum acceptable levels of ambient water quality – Actions Insure pollutant load does not exceed assimilative capacity while maintaining quality standards – Treatment

Water Quality Management Process Identify – Problem – Indicators – Target Values Assess source(s) Determine linkages – Sources  Targets Allocate permissible loads Monitor and evaluate Implement

Physical Processes Controlling Flux Advection – Solutes carried along by flowing water Diffusion – Transport by molecular diffusion Dispersion – Transport by mechanical mixing

Models Advection + dispersion - major processes by which dissolved matter is distributed throughout a water body (e.g., river) C = concentration (M/L 3 ) V = Average velocity in reach (L/T) D = Longitudinal dispersion coefficient (L 2 /T) t= time x = longitudinal distance Advection term Dispersion term Source term Reaction term Eq in text

Steady-state Model Steady-state –Where k = decay rate (1/T) –Solution is –W = loading (M/T) at x = 0 Eq in text

Advection - Dispersion

Advection Dominated Flow

Water Quality Example W 1, W 2 = Pollutant loads (kg/day) x 1, x 2 = Waste removal efficiencies (%) P 2 max, P 3 max = Water quality standards (mg/l) P 2, P 3 = Concentrations (mg/l) Q 1, Q 2, Q 3 = Flows (m 3 /sec) a 12, a 13, a 23, = Transfer coefficients

Water Quality Example

Paramet er UnitsValue Q1Q1 m 3 /s10 Q2Q2 m 3 /s12 Q3Q3 m 3 /s13 W1W1 kg/day250,000 W2W2 kg/day80,000 P1P1 mg/l32 P 2 max mg/l20 P 3 max mg/l20 a a a

Water Quality Example

Cost of treatment at 1 greater than cost at 2 (bigger waste load at 1) Marginal cost at 1 greater than marginal cost at 2, c 1 > c 2 for same level of treatment

Water Quality Example Cost of treatment at 1 >= cost at 2 marginal cost at 1, c 1, >= marginal cost at 2, c 1, for the same amount of treatment.

Water Quality Example

Example Irrigation project –1800 acre-feet of water per year Decision variables –x A = acres of Crop A to plant? –x B = acres of Crop B to plant? 1,800 acre feet = 2,220,267 m acre = 1,618,742 m 2 Crop ACrop B Water requirement (Acre feet/acre)32 Profit ($/acre) Max area (acres)400600

Example x A (hundreds acres) x B (hundreds acres) x B < 600 x A > 0 x A < 400 3x A +2 x B < 1800 x B > 0

Example x A (hundreds acres) x B (hundreds acres) x B < 600 x A > 0 x A < 400 x B > 0 Z=3600=300x A +500x B Z=2000=300x A +500x B Z=1000=300x A +500x B (200, 600)

GAMS Code POSITIVE VARIABLES xA, xB; VARIABLES obj; EQUATIONS objective, xAup, xBup, limit; objective.. obj =E= 300*xA+500*xB; xAup.. xA =L= 400.; xBup.. xB =L= 600.; limit.. 3*xA+2*xB =L= 1800; MODEL Calibrate / ALL /; SOLVE Calibrate USING LP MAXIMIZING obj; Display xA.l; Display xB.l; Marginal, Lagrange multiplier, shadow price, dual variable

GAMS Output LOWER LEVEL UPPER MARGINAL ---- EQU objective EQU xAup -INF EQU xBup -INF EQU limit -INF LOWER LEVEL UPPER MARGINAL ---- VAR xA INF VAR xB INF VAR obj -INF E+5 +INF. Marginal

Marginals Marginal for a constraint = Change in the objective per unit increase in RHS of that constraint. –i.e., change x B –Objective = 360,000 –Marginal for constraint = 300 –Expect new objective value = 360,300

New Solution LOWER LEVEL UPPER MARGINAL ---- EQU objective EQU xAup -INF EQU xBup -INF EQU limit -INF LOWER LEVEL UPPER MARGINAL ---- VAR xA INF VAR xB INF VAR obj -INF E+5 +INF. Note: Adding 1 unit to x B adds 300 to the objective, but constraint 3 says and this constraint is “tight” (no slack) so it holds as an equality, therefore x A must decrease by 1/3 unit for x B to increase by a unit.

Unbounded Solution x A (hundreds acres) x B (hundreds acres) x A > 0 x A < 400 x B > 0 unbounded Take out constraints 3 and 4, objective can Increase without bound

Infeasibility x A (hundreds acres) x B (hundreds acres) x B < 600 x A > 0 x A < 400 3x A +2 x B > 3000 x B > 0 Change constraint 4 to >= 3000, then no intersection of constraints exists and no feasible solution can be found

Multiple Optima Change objective coefficient to 200, then objective has same slope as constraint and infinite solutions exist x A (hundreds acres) x B (hundreds acres) x B < 600 x A > 0 x A < 400 x B > 0 Z=1800=300x A +200x B Infinite solutions on this edge 3x A +2 x B < 1800