ENGI 5708 Design of Civil Engineering Systems

Similar documents
ENGI 5708 Design of Civil Engineering Systems

ENGI 5708 Design of Civil Engineering Systems

ENGI 1313 Mechanics I

Introduction to sensitivity analysis

ENGI 1313 Mechanics I

ENGI 1313 Mechanics I

Introduction to LP. Types of Linear Programming. There are five common types of decisions in which LP may play a role

Linear programming Dr. Arturo S. Leon, BSU (Spring 2010)

9/23/ S. Kenny, Ph.D., P.Eng. Lecture Goals. Reading List. Students will be able to: Lecture 09 Soil Retaining Structures

Linear Programming: Sensitivity Analysis

Introduction to the Simplex Algorithm Active Learning Module 3

SENSITIVITY ANALYSIS IN LINEAR PROGRAMING: SOME CASES AND LECTURE NOTES

Sensitivity Analysis and Duality in LP

LINEAR PROGRAMMING: A GEOMETRIC APPROACH. Copyright Cengage Learning. All rights reserved.

Ch.03 Solving LP Models. Management Science / Prof. Bonghyun Ahn

Special cases of linear programming

Optimisation. 3/10/2010 Tibor Illés Optimisation

Linear Programming: Computer Solution and Sensitivity Analysis

MATH2070 Optimisation

Sensitivity Analysis and Duality

LP Definition and Introduction to Graphical Solution Active Learning Module 2

Worked Examples for Chapter 5

Linear and Combinatorial Optimization

Water Resources Systems: Modeling Techniques and Analysis

Deterministic Operations Research, ME 366Q and ORI 391 Chapter 2: Homework #2 Solutions

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

END3033 Operations Research I Sensitivity Analysis & Duality. to accompany Operations Research: Applications and Algorithms Fatih Cavdur

Brief 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

Business Statistics. Lecture 10: Correlation and Linear Regression

Liang Li, PhD. MD Anderson

Graphical and Computer Methods

MS-E2140. Lecture 1. (course book chapters )

ENM 202 OPERATIONS RESEARCH (I) OR (I) 2 LECTURE NOTES. Solution Cases:

3E4: Modelling Choice. Introduction to nonlinear programming. Announcements

Introduction. Very efficient solution procedure: simplex method.

MAT016: Optimization

Dr. S. Bourazza Math-473 Jazan University Department of Mathematics

ECE 307- Techniques for Engineering Decisions

The Uncertainty Threshold Principle: Some Fundamental Limitations of Optimal Decision Making under Dynamic Uncertainty

Lec12p1, ORF363/COS323. The idea behind duality. This lecture

Theory of constraints and linear programming: a reexamination

CS 543 Page 1 John E. Boon, Jr.

1 Review Session. 1.1 Lecture 2

Slack Variable. Max Z= 3x 1 + 4x 2 + 5X 3. Subject to: X 1 + X 2 + X x 1 + 4x 2 + X X 1 + X 2 + 4X 3 10 X 1 0, X 2 0, X 3 0

Yinyu Ye, MS&E, Stanford MS&E310 Lecture Note #06. The Simplex Method

Asymptotic relations in Cournot s game

Class 19. Daniel B. Rowe, Ph.D. Department of Mathematics, Statistics, and Computer Science. Marquette University MATH 1700

Branch-and-Price-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows

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

Solution Cases: 1. Unique Optimal Solution Reddy Mikks Example Diet Problem

MS-E2140. Lecture 1. (course book chapters )

ENGI 1313 Mechanics I

ENGI 1313 Mechanics I

Chapter 4 The Simplex Algorithm Part I

System Planning Lecture 7, F7: Optimization

Linear Programming. H. R. Alvarez A., Ph. D. 1

MATH2070/2970 Optimisation

(b) For the change in c 1, use the row corresponding to x 1. The new Row 0 is therefore: 5 + 6

+ 5x 2. = x x. + x 2. Transform the original system into a system x 2 = x x 1. = x 1

Formulating and Solving a Linear Programming Model for Product- Mix Linear Problems with n Products

Standard Error of Technical Cost Incorporating Parameter Uncertainty

Simplex tableau CE 377K. April 2, 2015

Introduction to Operations Research

Capacity Planning with uncertainty in Industrial Gas Markets

Cournot and Bertrand Competition in a Differentiated Duopoly with Endogenous Technology Adoption *

Near Optimal Solution for the Step Fixed Charge Transportation Problem

4.6 Linear Programming duality

Midterm Review. Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A.

AAEC 6524: Environmental Theory and Policy Analysis. Outline. Theory of Externalities and Public Goods. Klaus Moeltner Spring 2019.

Risk Analysis Framework for Severe Accident Mitigation Strategy in Nordic BWR: An Approach to Communication and Decision Making

Lecture 14 Transportation Algorithm. October 9, 2009

Prepared by: Assoc. Prof. Dr Bahaman Abu Samah Department of Professional Development and Continuing Education Faculty of Educational Studies

ENGI 1313 Mechanics I

Linear Programming and the Simplex method

Tutorial 2: Modelling Transmission

USAEE/IAEE. Diagnostic metrics for the adequate development of efficient-market baseload natural gas storage capacity.

Mathematical Methods and Economic Theory

CO350 Linear Programming Chapter 5: Basic Solutions

End-User Gains from Input Characteristics Improvement

CEE Computer Applications. Mathematical Programming (LP) and Excel Solver

Algebraic Simplex Active Learning Module 4

Answer the following questions: Q1: Choose the correct answer ( 20 Points ):

CHAPTER-3 MULTI-OBJECTIVE SUPPLY CHAIN NETWORK PROBLEM

Duality Theory, Optimality Conditions

Mathematical Foundations -1- Constrained Optimization. Constrained Optimization. An intuitive approach 2. First Order Conditions (FOC) 7

Welcome! Webinar Biostatistics: sample size & power. Thursday, April 26, 12:30 1:30 pm (NDT)

Optimization Methods in Management Science

ENGI 1313 Mechanics I

A Grey-Based Approach to Suppliers Selection Problem

ISE 330 Introduction to Operations Research: Deterministic Models. What is Linear Programming? www-scf.usc.edu/~ise330/2007. August 29, 2007 Lecture 2

Data Privacy in Biomedicine. Lecture 11b: Performance Measures for System Evaluation

Contents. Interactive Mapping as a Decision Support Tool. Map use: From communication to visualization. The role of maps in GIS

Storing energy or Storing Consumption?

x 4 = 40 +2x 5 +6x x 6 x 1 = 10 2x x 6 x 3 = 20 +x 5 x x 6 z = 540 3x 5 x 2 3x 6 x 4 x 5 x 6 x x

CS261: A Second Course in Algorithms Lecture #9: Linear Programming Duality (Part 2)

56:171 Operations Research Midterm Exam - October 26, 1989 Instructor: D.L. Bricker

LINEAR PROGRAMMING. Introduction

Assistant Prof. Abed Schokry. Operations and Productions Management. First Semester

CS 275 Automata and Formal Language Theory

Monopoly Regulation in the Presence of Consumer Demand-Reduction

Transcription:

ENGI 5708 Design of Civil Engineering Systems Lecture 10: Sensitivity Analysis Shawn Kenny, Ph.D., P.Eng. Assistant Professor Faculty of Engineering and Applied Science Memorial University of Newfoundland spkenny@engr.mun.ca

Lecture 10 Objective to understand parameters influencing sensitivity of LP problems 2 2008 S. Kenny, Ph.D., P.Eng. ENGI 5708 Civil Engineering Systems Lecture 10

Motivation for Sensitivity Analysis Model Idealization Abstraction of reality, linearization Relationship between variables, constraints, coefficients Scope extent, system hierarchy Quantifiable fact or importance Subjectivity Uncertainty Natural variability or volatility Regulations, economics, resources Mechanisms Poor or incomplete understanding of processes Data Bias, error or sample size 3 2008 S. Kenny, Ph.D., P.Eng. ENGI 5708 Civil Engineering Systems Lecture 10

What is Sensitivity Analysis? Tool for Decision Making Heuristic analysis Trial and error What if scenario analysis Assess importance of possible events (i.e. change in parameter value) and probable outcomes from these changes or variability 4 2008 S. Kenny, Ph.D., P.Eng. ENGI 5708 Civil Engineering Systems Lecture 10

Why Conduct Sensitivity Analysis? Rank Assessment Screening tool Identify key elements and parameters Increase or decrease model complexity Focus effort and resources Model advancement or refinement Test optimal solution robustness Identify critical parameters Establish thresholds (upper/lower bounds) Contingency planning Impact to optimal solution or decision making? Set conditions for changes in strategy 5 2008 S. Kenny, Ph.D., P.Eng. ENGI 5708 Civil Engineering Systems Lecture 10

Sensitivity Analysis Constraint Equation Coefficient (a mn ) Right-Hand Side Constraints (C m ) Objective Function Coefficient (k n ) Add New Decision Variables Add Constraint Equations Objective Function or Merit Function (Non-$) N ( ) Z = f x = k x N n n n n= 1 n= 1 min or max Constraint Equations M M N ( ) g x = a x, =, C m n mn n m m= 1 m= 1n= 1 6 2008 S. Kenny, Ph.D., P.Eng. ENGI 5708 Civil Engineering Systems Lecture 10

Constraint Equation Coefficient Possible Variation Volume, production rate or yield of a process or resource Example 6-01 Clay volume, blending time or storage capacity per unit volume of product Impact Constraint equation slope region Basic feasible solutions F A E D C B Example 6-01 7 2008 S. Kenny, Ph.D., P.Eng. ENGI 5708 Civil Engineering Systems Lecture 10

Constraint Equation Coefficient (cont.) Example 6-01 Double HYDIT blending time 5 x + 5 x 50 10 x + 5 x 50 1 2 1 2 Example 6-01 8 2008 S. Kenny, Ph.D., P.Eng. ENGI 5708 Civil Engineering Systems Lecture 10

Constraint Equation Coefficient (cont.) Example 6-01 Double FILIT blending time 5x + 5x 50 5x + 10x 50 1 2 1 2 Example 6-01 9 2008 S. Kenny, Ph.D., P.Eng. ENGI 5708 Civil Engineering Systems Lecture 10

Right-Hand Side Constraint Possible Variation Maximum capacity, resource availability, usage or time Example 6-01 Total clay volume, blending time or storage capacity Impact Constraint equation shift region Basic feasible solutions F A E D C B Example 6-01 10 2008 S. Kenny, Ph.D., P.Eng. ENGI 5708 Civil Engineering Systems Lecture 10

Right-Hand Side Constraint (cont.) Example 6-01 Increase total available blending time to 70 hrs 5 x + 5 x 50 5x + 5 x 70 1 2 1 2 Example 6-01 11 2008 S. Kenny, Ph.D., P.Eng. ENGI 5708 Civil Engineering Systems Lecture 10

Right-Hand Side Constraint (cont.) Example 6-01 Decrease total available blending time to 30 hrs 5 x + 5 x 50 5x + 5 x 30 1 2 1 2 Example 6-01 12 2008 S. Kenny, Ph.D., P.Eng. ENGI 5708 Civil Engineering Systems Lecture 10

Right-Hand Side Constraint (cont.) Binding Constraints If binding then RHS limits value of obj. function 2x1+ 4x2 28 5x1+ 5x2 50 x1 8 x2 6 x, x 0 1 2 F A E D Example 6-01 Unique Optimal Solution x 1 = 6; x 2 = 4 C B Z = 140x + 160x 1 2 13 2008 S. Kenny, Ph.D., P.Eng. ENGI 5708 Civil Engineering Systems Lecture 10

Right-Hand Side Constraint (cont.) Binding Constraints Reduced cost coefficients Clay Volume { } B s, x, x, s s s s = Example 6-01 D 3 2 1 4 1 2 3 = 2 2 1+ 5 2 x = 4 s + s 1 1 2 2 1 5 2 1 2 1 = 6 + 1 2 5 2 1 1 4 = 2 + 2 1 5 2 x s s s s s Z = 1480 10s 24s Blending Time 1 2 Unique Optimal Solution x 1 = 6; x 2 = 4 14 2008 S. Kenny, Ph.D., P.Eng. ENGI 5708 Civil Engineering Systems Lecture 10 F A E D C B

Right-Hand Side Constraint (cont.) Non-Binding Constraints Look at basic variables { } B s, x, x, s s s s D 3 2 1 4 1 2 3 = 2 2 1+ 5 2 x = 4 s + s 1 1 2 2 1 5 2 1 2 1 = 6 + 1 2 5 2 1 1 4 = 2 + 2 1 5 2 x s s s s s Z = 1480 10s 24s HYDIT Storage = Example 6-01 FILIT Storage 1 2 Unique Optimal Solution x 1 = 6; x 2 = 4 15 2008 S. Kenny, Ph.D., P.Eng. ENGI 5708 Civil Engineering Systems Lecture 10 F A E D Increasing storage capacity has no effect on strategy C B

Right-Hand Side Constraint (cont.) Shadow Prices or Dual Resource Prices Reduced cost coefficients Tolerable range on variability? ll constraint line thru adjacent vertex Clay Volume Z = 1480 10s 24s Blending Time 1 2 16 2008 S. Kenny, Ph.D., P.Eng. ENGI 5708 Civil Engineering Systems Lecture 10 F A E G D Example 6-01 Unique Optimal Solution x 1 = 6; x 2 = 4 C B H

Right-Hand Side Constraint (cont.) Shadow Prices or Dual Resource Prices 2x1+ 4x2 28 5x + 5x 50 1 2 Clay Volume Blending Time x1 8 x 2 6 HYDIT Storage FILIT Storage Resource Wabash Red Clay Blending Time HYDIT Curing Vat Capacity FILIT Curing Vat Capacity Current RHS Optimal Usage Lower Range 24 m 3 28 m 3 28 m 3 (C 8,2) 50 hr 50 hr 40 hr (E 2,6) 6 m 3 8 m 3 6 m 3 (D 6,4) 4 m 3 6 m 3 4 m 3 (D 6,4) Allowable Decrease Upper Range 4 m 3 32 m 3 (G 4,6) 10 hr 55 hr (H 8,3) Allowable Increase Shadow Price 4 m 3 $10 5 hr $24 2 m 3 Unlimited $0 2 m 3 Unlimited $0 17 2008 S. Kenny, Ph.D., P.Eng. ENGI 5708 Civil Engineering Systems Lecture 10

Right-Hand Side Constraint (cont.) Shadow Prices or Dual Resource Shadow price implications If unit price of clay $10/t then purchase If supplier failed to deliver clay then for this range the compensation price is $10/t Vat capacity provides no improved profits Resource Wabash Red Clay Blending Time HYDIT Curing Vat Capacity FILIT Curing Vat Capacity Optimal Usage Allowable Decrease Allowable Increase Shadow Price 28 m 3 4 m 3 4 m 3 $10 50 hr 10 hr 5 hr $24 6 m 3 2 m 3 Unlimited $0 4 m 3 2 m 3 Unlimited $0 18 2008 S. Kenny, Ph.D., P.Eng. ENGI 5708 Civil Engineering Systems Lecture 10

Objective Function Possible Variation Unit cost or profit Unit gain or loss Impact Objective function slope Optimal solution 2 1 Increasing HYDIT Profit 3 4 4 Increasing FILIT Profit 1 2 3 19 2008 S. Kenny, Ph.D., P.Eng. ENGI 5708 Civil Engineering Systems Lecture 10

Reading List Pike, R.W. (2001). Optimization for Engineering Systems. http://www.mpri.lsu.edu/bookindex.html Arsham (2007). Linear Programming. http://home.ubalt.edu/ntsbarsh/opre640a/partviii.htm#rplp Arsham (2007). Linear Programming. http://home.ubalt.edu/ntsbarsh/businessstat/opre/partvii.htm#rintrodu 20 2008 S. Kenny, Ph.D., P.Eng. ENGI 5708 Civil Engineering Systems Lecture 10

References ReVelle, C.S., E.E. Whitlatch, Jr. and J.R. Wright (2004). Civil and Environmental Systems Engineering 2 nd Edition, Pearson Prentice Hall ISBN 0-13-047822-9 21 2008 S. Kenny, Ph.D., P.Eng. ENGI 5708 Civil Engineering Systems Lecture 10