1 Capacity Planning under Uncertainty Capacity Planning under Uncertainty CHE: 5480 Economic Decision Making in the Process Industry Prof. Miguel Bagajewicz.

Slides:



Advertisements
Similar presentations
Introduction to Mathematical Programming
Advertisements

Logistics Network Configuration
Linear Programming Models & Case Studies
1 Inventory Control for Systems with Multiple Echelons.
Tutorial 10: Performing What-If Analyses
Operations management Session 17: Introduction to Revenue Management and Decision Trees.
1 Dynamic portfolio optimization with stochastic programming TIØ4317, H2009.
Managerial Decision Modeling with Spreadsheets
Introduction to Linear and Integer Programming
Alexei A.Gaivoronski June 2001 Universita’ degli Studi di Bergamo Corso di dottorato di ricerca 1 Telecommunications: Introduction of new service Service:
Spreadsheet Demonstration New Car Simulation. 2 New car simulation Basic problem  To simulate the profitability of a new model car over a several-year.
1 FINANCIAL RISK CHE 5480 Miguel Bagajewicz University of Oklahoma School of Chemical Engineering and Materials Science CHE 5480 Miguel Bagajewicz University.
Engineering Economic Analysis Canadian Edition
Applications of Stochastic Programming in the Energy Industry Chonawee Supatgiat Research Group Enron Corp. INFORMS Houston Chapter Meeting August 2, 2001.
CIIEM 2007  Energetic Installations  Badajoz, June 2007 Robust Optimization in Heat Exchanger Network Synthesis João MIRANDA (1), Miguel CASQUILHO.
Supply Chain Design Problem Tuukka Puranen Postgraduate Seminar in Information Technology Wednesday, March 26, 2009.
Basic Optimization Problem Notes for AGEC 641 Bruce McCarl Regents Professor of Agricultural Economics Texas A&M University Spring 2005.
INTRODUCTION TO LINEAR PROGRAMMING
Linear-Programming Applications
Solving Linear Programming Problems Using Excel Ken S. Li Southeastern Louisiana University.
Linear Programming Operations Research – Engineering and Math Management Sciences – Business Goals for this section  Modeling situations in a linear environment.
Network Flows Based on the book: Introduction to Management Science. Hillier & Hillier. McGraw-Hill.
©Chelst & Canbolat Value-Added Decision Making Chapter 2 – Influence Diagrams Learn by example Learn vocabulary and grammar 9/19/
ICALP'05Stochastic Steiner without a Root1 Stochastic Steiner Trees without a Root Martin Pál Joint work with Anupam Gupta.
Supply Contract Allocation Gyana R. Parija Bala Ramachandran IBM T.J. Watson Research Center INFORMS Miami 2001.
Prof. H.-J. Lüthi WS Budapest , 1 Hedging strategy and operational flexibility in the electricity market Characteristics of the electricity.
Empirical Financial Economics Asset pricing and Mean Variance Efficiency.
Chapter 12 Discrete Optimization Methods
Linear Programming Topics General optimization model LP model and assumptions Manufacturing example Characteristics of solutions Sensitivity analysis Excel.
Copyright © 2008 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin 12 Financial and Cost- Volume-Profit Models.
STDM - Linear Programming 1 By Isuru Manawadu B.Sc in Accounting Sp. (USJP), ACA, AFM
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.
The McGraw-Hill Companies, Inc. 2006McGraw-Hill/Irwin 12 Financial and Cost- Volume-Profit Models.
Stochastic Multicast with Network Coding Ajay Gopinathan, Zongpeng Li Department of Computer Science University of Calgary ICDCS 2009, June , Montreal.
Process Optimization By Dr : Mona Ossman.
Introduction. MS / OR Definition: Management Science (MS) or Operations Research (OR) is the scientific discipline devoted to the analysis and solution.
Risk Modeling Chapter 20. What is "risk"? Some outcomes, such as yields or prices, are not known with certainty. In risk modeling, we often assume that.
1 INTRODUCTION TO LINEAR PROGRAMMING CONTENTS Introduction to Linear Programming Applications of Linear Programming Reference: Chapter 1 in BJS book.
Part 3 Linear Programming 3.3 Theoretical Analysis.
1 Solving Infinite Horizon Stochastic Optimization Problems John R. Birge Northwestern University (joint work with Chris Donohue, Xiaodong Xu, and Gongyun.
1 FINANCIAL RISK CHE 5480 Miguel Bagajewicz University of Oklahoma School of Chemical Engineering and Materials Science CHE 5480 Miguel Bagajewicz University.
© Rania Hassan; adapted by R. de Neufville Flexibility versus Robustness What’s in a Name?
OPSM 301 Operations Management Class 11: Linear Programming using Excel Koç University Zeynep Aksin
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
FYRIRLESTRAMARAÞON HR 2011 | RU LECTURE MARATHON 2011 Amir Azaron School of Science and Engineering Supply Chain Design under Uncertainty.
Linear Programming Short-run decision making model –Optimizing technique –Purely mathematical Product prices and input prices fixed Multi-product production.
Ence 627 Decision Analysis for Engineering Project Portfolio Selection: “Optimal Budgeting of Projects Under Uncertainty” Javier Ordóñez.
Chapter 8 of Quantitative Methods for Business by Anderson, Sweeney and Williams Read sections 8.1, , 8.4 (omitting “Simultaneous Changes”), 8.5,
1 CAPACITY INVESTMENT PLANNING MODEL CAPACITY INVESTMENT PLANNING MODEL CHE Spring 2003 University of Oklahoma School of Chemical Engineering and.
LINEAR PROGRAMMING. Linear Programming Linear programming is a mathematical technique. This technique is applied for choosing the best alternative from.
Part 3 Linear Programming 3.3 Theoretical Analysis.
Supplementary Chapter B Optimization Models with Uncertainty
Linear Programming Topics General optimization model
Linear Programming – Introduction
The assignment problem
6.5 Stochastic Prog. and Benders’ decomposition
MBA 651 Quantitative Methods for Decision Making
Exam 1 Review/Instructions
Linear Programming Topics General optimization model
Chapter 12 Determining the Optimal Level of Product Availability
Linear Programming Topics General optimization model
Linear Programming Topics General optimization model
Stochastic Network Interdiction
Linear Programming I: Simplex method
Addressing uncertainty in a transshipment problem
Linear Programming Introduction.
Operations Research Models
Linear Programming Introduction.
6.5 Stochastic Prog. and Benders’ decomposition
Linear Programming.
Presentation transcript:

1 Capacity Planning under Uncertainty Capacity Planning under Uncertainty CHE: 5480 Economic Decision Making in the Process Industry Prof. Miguel Bagajewicz University of Oklahoma School of Chemical Engineering and Material Science CHE: 5480 Economic Decision Making in the Process Industry Prof. Miguel Bagajewicz University of Oklahoma School of Chemical Engineering and Material Science

2 Characteristics of Two-Stage Stochastic Optimization Models Characteristics of Two-Stage Stochastic Optimization Models Philosophy Philosophy Maximize the Expected Value of the objective over all possible realizations of Maximize the Expected Value of the objective over all possible realizations of uncertain parameters. uncertain parameters. Typically, the objective is Profit or Net Present Value. Typically, the objective is Profit or Net Present Value. Sometimes the minimization of Cost is considered as objective. Sometimes the minimization of Cost is considered as objective. Uncertainty Uncertainty Typically, the uncertain parameters are: market demands, availabilities, Typically, the uncertain parameters are: market demands, availabilities, prices, process yields, rate of interest, inflation, etc. prices, process yields, rate of interest, inflation, etc. In Two-Stage Programming, uncertainty is modeled through a finite number In Two-Stage Programming, uncertainty is modeled through a finite number of independent Scenarios. of independent Scenarios. Scenarios are typically formed by random samples taken from the probability Scenarios are typically formed by random samples taken from the probability distributions of the uncertain parameters. distributions of the uncertain parameters.

3 First-Stage Decisions First-Stage Decisions Taken before the uncertainty is revealed. They usually correspond to structural Taken before the uncertainty is revealed. They usually correspond to structural decisions (not operational). decisions (not operational). Also called “Here and Now” decisions. Also called “Here and Now” decisions. Represented by “Design” Variables. Represented by “Design” Variables. Examples: Examples: Characteristics of Two-Stage Stochastic Optimization Models Characteristics of Two-Stage Stochastic Optimization Models −To build a plant or not. How much capacity should be added, etc. −To place an order now. −To sign contracts or buy options. −To pick a reactor volume, to pick a certain number of trays and size the condenser and the reboiler of a column, etc the condenser and the reboiler of a column, etc

4 Second-Stage Decisions Second-Stage Decisions Taken in order to adapt the plan or design to the uncertain parameters Taken in order to adapt the plan or design to the uncertain parameters realization. realization. Also called “Recourse” decisions. Also called “Recourse” decisions. Represented by “Control” Variables. Represented by “Control” Variables. Example: the operating level; the production slate of a plant. Example: the operating level; the production slate of a plant. Sometimes first stage decisions can be treated as second stage decisions. Sometimes first stage decisions can be treated as second stage decisions. In such case the problem is called a multiple stage problem. In such case the problem is called a multiple stage problem. Characteristics of Two-Stage Stochastic Optimization Models Characteristics of Two-Stage Stochastic Optimization Models

5 Two-Stage Stochastic Formulation LINEAR MODEL SP s.t. First-Stage Constraints Second-Stage Constraints RecourseFunctionFirst-StageCost First stage variables Second Stage Variables Technology matrix Recourse matrix (Fixed Recourse) Sometimes not fixed (Interest rates in Portfolio Optimization) Complete recourse: the recourse cost (or profit) for every possible uncertainty realization remains finite, independently of the first-stage decisions (x). Relatively complete recourse: the recourse cost (or profit) is feasible for the set of feasible first-stage decisions. This condition means that for every feasible first-stage decision, there is a way of adapting the plan to the realization of uncertain parameters. We also have found that one can sacrifice efficiency for certain scenarios to improve risk management. We do not know how to call this yet. Let us leave it linear because as is it is complex enough.!!!

6 Process Planning Under Uncertainty OBJECTIVES: Maximize Expected Net Present Value Maximize Expected Net Present Value Minimize Financial Risk Minimize Financial Risk Production Levels Production Levels DETERMINE: Network Expansions Network Expansions TimingSizingLocation GIVEN: Process Network Process Network Set of Processes Set of Chemicals A A 1 1 C C 2 2 D D 3 3 B B Forecasted Data Forecasted Data Demands & Availabilities Costs & Prices Capital Budget

7 Process Planning Under Uncertainty Design Variables: to be decided before the uncertainty reveals  x  E it Y,, Q Y: Decision of building process i in period t E: Capacity expansion of process i in period t Q: Total capacity of process i in period t Control Variables: selected after the uncertain parameters become known S: Sales of product j in market l at time t and scenario s S: Sales of product j in market l at time t and scenario s P: Purchase of raw mat. j in market l at time t and scenario s P: Purchase of raw mat. j in market l at time t and scenario s W: Operating level of of process i in period t and scenario s  ysys  P jlts S,, W its

8 MODELMODEL LIMITS ON EXPANSION I : Processes i,=1,…,NP J : Raw mat./Products, j=1,…,NC T: Time periods. T=1,…,NT L: Markets, l=1,..NM NEXP t : maximum number of expansions in period t α it : Variable cost of expansion for process i in period t β it : Fixed cost of expansion for process i in period t Lower and upper bounds on a process expansion in period t TOTAL CAPACITY IN EACH PERIOD LIMIT ON THE NUMBER OF EXPANSIONS Y it : An expansion of process I in period t takes place (Yit=1), does not take place (Yit=0) E it : Expansion of capacity of process i in period t. Q it : Capacity of process i in period t. LIMIT ON THE CAPITAL INVESTMENT

9 MODELMODEL UTILIZED CAPACITY IS LOWER THAN TOTAL CAPACITY I : Processes i,=1,…,NP J : Raw mat./Products, j=1,…,NC T: Time periods. T=1,…,NT L: Markets, l=1,..NM MATERIAL BALANCE BOUNDS Y it : An expansion of process I in period t takes place (Yit=1), does not take place (Yit=0) E it : Expansion of capacity of process i in period t. Q it : Capacity of process i in period t. W it : Utilized capacity of process i in period t. P jlt : Amount of raw material/intermediate product j consumed from market l in period t S jlt : Amount of intermediate product/product j sold in market l in period t NONNEGATIVITY INTEGER VARIABLES Lower and upper bounds on availability of raw material j in market l in period t, scenario s Lower and upper bounds on demand of product j in market l in period t, scenario s

10 MODELMODEL OBJECTIVE FUNCTION I : Processes i,=1,…,NP J : Raw mat./Products, j=1,…,NC T: Time periods. T=1,…,NT L: Markets, l=1,..NM Y it : An expansion of process I in period t takes place (Yit=1), does not take place (Yit=0) E it : Expansion of capacity of process i in period t. W it : Utilized capacity of process i in period t. P jlt : Amount of raw material/interm. product j consumed from market l in period t S jlt : Amount of intermediate product/product j sold in market l in period t γ jlt : Sale price of product/intermediate product j in market l in period t Γ jlt : Cost of product/intermediate product j in market l in period t δ it : Operating cost of process i in period t α it : Variable cost of expansion for process i in period t β it : Fixed cost of expansion for process i in period t L t : Discount factor for period t DISCOUNTED REVENUES INVESTMENT

11 ExampleExample Uncertain Parameters: Demands, Availabilities, Sales Price, Purchase Price Uncertain Parameters: Demands, Availabilities, Sales Price, Purchase Price Total of 400 Scenarios Total of 400 Scenarios Project Staged in 3 Time Periods of 2, 2.5, 3.5 years Project Staged in 3 Time Periods of 2, 2.5, 3.5 years Process 1 Chemical 1 Process 2 Chemical 5 Chemical 2 Chemical 6 Process 3 Chemical 3 Process 5 Chemical 7 Chemical 8 Process 4 Chemical 4

12 Period 1 2 years Period years Period years Process 1 Chemical 1 Chemical 5 Process 3 Chemical 3 Chemical kton/yr kton/yr 5.27 kton/yr kton/yr Process 1 Chemical 1 Chemical 5 Process 3 Chemical 3 Process 5 Chemical 7 Chemical 8 Process 4 Chemical kton/yr kton/yr 4.71 kton/yr kton/yr kton/yr Chemical 1 Process 2 Chemical 5 Chemical 2 Chemical 6 Process 3 Chemical 3 Process 5 Chemical 7 Chemical 8 Process 4 Chemical kton/yr ton/yr kton/yr kton/yr kton/yr kton/yr kton/yr kton/yr kton/yr Process 1 Example – Solution with Max ENPV

13 Period 1 2 years Period years Period years Example – Solution with Min DRisk(  =900) Process 1 Chemical 1 Chemical 5 Process 3 Chemical 3 Chemical kton/yr kton/yr 5.59 kton/yr kton/yr Process 1 Chemical 1 Chemical 5 Process 3 Chemical 3 Process 5 Chemical 7 Chemical 8 Process 4 Chemical kton/yr kton/yr kton/yr 4.99 kton/yr kton/yr kton/yr Process 1 Chemical 1 Process 2 Chemical 5 Chemical 2 Chemical 6 Process 3 Chemical 3 Process 5 Chemical 7 Chemical 8 Process 4 Chemical kton/yr ton/yr kton/yr 7.54 kton/yr 2.39 kton/yr 5.15 kton/yr kton/yr 5.15 kton/yr kton/yr

14 Example – Solution with Max ENPV