Scheduling of Crude Oil Movements at Refinery Front-end
|
|
- Shonda Cross
- 6 years ago
- Views:
Transcription
1 Scheduling of Crude Oil Movemens a Refinery Fron-end Ramkumar Karuppiah and Ignacio Grossmann Carnegie Mellon Universiy ExxonMobil Case Sudy: Dr. Kevin Furman Enerprise-wide Opimizaion Projec March 15,
2 Moivaion - Scheduling and Planning of flow of crude oil is key problem in perochemical refineries - Large cos savings can be realized wih an opimum schedule for he movemen of crude oil Vessels Sorage Charging Crude-Disillaion Uni How o coordinae discharge of vessels wih loading o sorage? How o synchronize charging anks wih crude-oil disillaion? 2
3 Crude Disillaion Uni 3
4 Problem Saemen Crude oil supply sreams Sorage Tanks Charging Tanks Crude Disillaion Unis Given: (a) Maximum and minimum invenory levels for a ank (b) Iniial oal and componen invenories in a ank (c) Upper and lower bounds on he fracion of key componens in he crude inside a ank (d) Times of arrival of crude oil in he supply sreams (e) Amoun of crude arriving in he supply sreams (f) Fracions of various componens in he supply sreams (g) Bounds on he flowraes of he sreams in he nework (h) Time horizon for scheduling Deermine: (i) Toal and componen invenory levels in he anks a various poins of ime (ii) Volumes of oal and componen flows from one uni o anoher in a cerain ime inerval (iii) Sar and end imes of he flows in each sream of he sysem. Objecive: Minimize Cos MILP Model: Lee, Pino, Grossmann, Park (1996) 4
5 Assumpions MINLP Model 1. Perfec mixing akes place in each ank. 2. Negligible change in specific graviies on mixing. 3. Discree flows of volumes ino and from a ank. 4. Simulaneous inpus ino and oupus from a ank are no allowed. 5. Each disillaion uni can be charged by a mos one charging ank a a poin of ime. 6. Each charging ank can charge a mos one disillaion uni a a poin of ime. 7. All he disillaion unis have o be operaed coninuously hroughou he enire ime horizon. 5
6 Scheduling Model Coninuous ime formulaion by Furman e al. (2006) Sae Task Nework Represenaion Based on ime evens where inpus and oupus o an uni can ake place in he same ime even No simulaneous inpu ino and from a ank Formulaion reduces number of binary variables required in he scheduling model Opimizaion model : min cos objecive (P) s.. Tank consrains Disillaion uni consrains Supply sream consrains Variable bounds Variables in he model : o I b, j I b, o V s, j V s, 1 T s, 2 T s, w s, Toal invenory in ank b a end of ime even Invenory of componen j in ank b a end of ime even Toal flow in sream s in ime even Flow of componen j in sream s in ime even Sar ime of flow in sream s in ime even End ime of flow in sream s in ime even Binary variable peraining o exisence of flow in sream s in ime even 6
7 Consrains in Model Tank consrains Overall mass balance Individual componen balance Non-linear equaions conaining Bilineariies Logic consrains o Relaed o he exisence of a flow ino or from a ank in a ime even Duraion consrains o To bound he flow of a sream ino/from a ank in a paricular ime even Simple sequencing consrains Invenory bounds Bounds on componen fracions inside a ank Inpu and oupu resrains over whole horizon 7
8 Consrains in Model (Cond ) Disillaion uni consrains Coninuous ime operaion consrain Allocaion consrains o Only one CDU can be charged by a charging ank in a ime even o Only one charging ank can charge a CDU in a ime even Crude-mix demand consrains Supply sream consrains Overall mass balances Componen mass balances Sar and end iming consrains 8
9 Non-convex MINLP Objecive funcion : Minimize a cos objecive similar o he one by Jia and Ieraperiou (2003) min oal cos = waiing cos for supply sreams + unloading cos of supply sreams + invenory cos for each ank over scheduling horizon + changeover cos for charging CDUs wih differen charging anks Overall model (P) Non-convex MINLP Convex relaxaion of (P) (obained by linearizing non-linear equaions in Tank consrains and inroducing McCormick convex envelopes (1976) for bilinear erms) (R) MILP 9
10 Global Opimizaion of MINLP Large-scale non-convex MINLPs such as (P) are very difficul o solve Global opimizaion solvers fail o converge o soluion in racable compuaional imes (e.g. BARON) Special Ouer-Approximaion algorihm proposed o solve problem o global opimaliy NLP fixed 0-1 Upper Bound Maser MILP Lower Bound Guaraneed o converge o global opimum wihin olerance of lower and upper bounds Upper Bound : Feasible soluion of (P) obained by fixing he binary variables o he values obained from he soluion of he relaxaion and solving he resuling NLP Lower Bound : Obained by solving a convex relaxaion (R) of he non-convex MINLP model wih Lagrangean Decomposiion based cus added o i 10
11 Upper Bound Local soluion of NLP- non-rigorous Lower bound on Global Opimum Convex relaxaion (R) is a large MILP and is also difficul o solve Generae cus o add o relaxaion o srenghen i and reduce soluion imes Karuppiah and Grossmann (2006) Cu generaion performed by a spaial decomposiion of he nework srucure 11
12 Spaial Decomposiion of he nework Crude oil arrivals Sorage Tanks Charging Tanks Crude Disillaion Unis D1 b a D2 Nework is spli ino wo decoupled sub-srucures D1 and D2 Physically inerpreed as cuing some pipelines (Here a and b ) Se of spli sreams denoed by p {a, b } 12
13 Decomposiion of he model Creae wo copies of he variables peraining o he spli sreams and ge wo ses of duplicae variables :,1,1,1 2,1, { V V, T, T w } o j 1 1 p,, p, p, p, p, The equaions involving he spli sreams in model (R) are re-wrien in erms of he newly creaed variables These duplicae variables are relaed by equaliy consrains which are added o (R) o ge model (RP): o,1 o,2 Vp, = Vp, p, and,2,2,2 2,2 { V V, T, T, w } o j 1 2 p,, p, p, p, p, {, V, T, T w } o j 1 2 V p, p, p, p,, p, j,1,2 j V p, = V p, j, p, 1,1 1,2,, Tp = Tp p, 2,1 2,2,, Tp = Tp p, Non-anicipaiviy consrains 1 2,, wp = wp p, Non-anicipaiviy consrains in (RP) are muliplied by Lagrange mulipliers and ransferred o objecive funcion o bring model o a decomposable form which is decomposed ino sub-models (LD1) and (LD2) 13
14 Decomposed Sub-models Sub-problem involves duplicae variables o,1 j,1 1,1 2,1 1 { V V, T, T w } p,, p, p, p,, p, min z 1 = s.. waiing cos for supply sreams + unloading cos of supply sreams + invenory cos for anks in D1 over scheduling horizon + changeover cos for charging CDUs in D1 wih differen charging anks + Vo o,1 V j,1 T1 1,1 T2 2,1 λp V p, + λ j, p, V p, + λ p, Tp, + λ p, Tp, + p w, λ p, j p p p p Tank consrains Disillaion uni consrains Supply sream consrains Variable bounds w 1 p, (LD1) Globally opimize o ge soluion * z 1 Sub-problem involves duplicae variables o,2 j,2 1,2 2,2 2 { V V, T, T w } p,, p, p, p,, p, min z 2 = invenory cos for anks in D2 over scheduling horizon + changeover cos for charging CDUs in D2 wih differen charging anks + p Vo o,2 p p λ, V, λ,, V, λ T λ T λ, w j p V j p j,2 p p T1 1,2 p, p, p T2 2,2 p, p, p w p 2 p, Globally opimize o ge soluion s.. Tank consrains Disillaion uni consrains Variable bounds (LD2) * z 2 14
15 Cu Generaion * Using soluions and z we develop he following cus : * z 1 2 * z 1 waiing cos for supply sreams + unloading cos of supply sreams + invenory cos for anks in D1 over scheduling horizon + changeover cos for charging CDUs in D1 wih differen charging anks + Vo o V j T1 1 T 2 2 λp p, + λ j, p, Vp, + λp, Tp, + λp, Tp, + p w, V λp, wp, j p p p p Lagrange Mulipliers * z 2 invenory cos for anks in D2 over scheduling horizon + changeover cos for charging CDUs in D2 wih differen charging anks + p λ Vo o V j T1 1 T 2 2 w p, p j p p p p p p λp j p p p p V, λ,, V, λ, T, λ, T,, w, p Add above cus o (R) o ge (R ) which is solved o obain a valid lower bound on global opimum of (P) Remark: Updae Lagrange mulipliers and generae more cus o add o (R) 15
16 Advanages of Cu Generaion Lower bound obained is sronger (or as srong) han one from convenional Lagrangean decomposiion or LP relaxaion of (R) Alernaive decomposiion schemes can be used o generae more cus o ighen relaxaion (R) c D2 d D1 16
17 Proposed Algorihm Ouer-Approximaion based algorihm: Sep1: Preprocessing Bounds on he variables in he model are deermined by physical inspecion of he nework srucure and using he numerical daa given Sep2: Lower Bound Generaion Generae a valid lower bound on he soluion by solving (R ) Sep3: Upper bound Fix ineger variables in (P) o he values obained from soluion of (R ) and solve resuling non-convex NLP denoed by (P-NLP) Sep4: Ineger Cu Making use of he ineger soluion of (R ), add an ineger cu o model (R ) o preclude he curren combinaion of ineger variables from re-appearing in fuure ieraions Sep5: Convergence Ierae beween solving models (R ) and (P-NLP) ill he lower bound exceeds he upper bound or he relaxaion gap beween he lower and upper bounds is less han a specified olerance 17
18 Illusraive Example 3 Supply sreams 6 Sorage Tanks 4 Charging Tanks 3 Disillaion unis Scheduling Horizon Number of Inpu sources IN1 IN2 IN3 Arrival Time Number of Sorage Tanks Tank1 Capaciy Incoming Volume of crude Iniial Invenor y hours 3 Fracion of key componen Iniial fracion of key componen (min max) ( ) Number of Charging Tanks Tank1 Tank2 Tank3 Tank4 Capaciy Iniial Invenory Iniial Fracion of key componen (min max) ( ) ( ) ( ) ( ) Number of CDUs : 3 Waiing cos for supply sreams (Csea): 5 Unloading cos for supply sreams (Cunload): 7 Tank invenory coss (Cinv(b)): sorage anks 0.05; charging anks 0.06 Changeover cos for charged oil swich (Cse): 30 3 Tank2 Tank3 Tank4 Tank ( ) 0.05 ( ) ( ) ( ) Demand of mixed oils by CDUs : oil mix 1 60 oil mix 2 60 oil mix 3 60 oil mix 4 60 Tank ( ) Bounds on flowraes in he sreams: Lower Bound 1.5, Upper Bound 70 18
19 Opimal Crude Flow Schedule Gan char of opimal schedule Invenory Profiles for Sorage Tanks Sorage ank 2 (ST2) Sorage Tank 3 (ST3) Sorage Tank 4 (ST4) 60 Invenory --> ime (# unis) --> Invenory Profiles for Charging Tanks Charging ank 1 (CT1) Charging Tank 2 (CT2) Charging Tank 3 (CT3) Charging Tank 4 (CT4) Invenory --> ime (# unis) --> 19
20 Opimal Crude Flow Schedule Gan char of opimal schedule Charging schedule of Disillaion unis CDU1 being charged CDU2 being charged CDU3 being charged DU3 CT CT3 CT4 DU2 30 CT3 CT DU CT2 60 CT ime (# unis) --> 20
21 Preliminary Compuaional Resuls MINLP 57 binary variables, 439 coninuous variables and 1564 consrains Sub-opimal soluions obained (using GAMS/ DICOPT) : 447 or 463 vs (global) Proposed Algorihm : Solvers Used : MILP CPLEX 9.0, NLP CONOPT3 Cu generaion ime* = s Lower bound : On solving (R) (wihou cus) On solving (R ) (wih proposed cus) Upper bound : Toal ime* aken o solve problem = s Soluion Time* (sec) Lower and Upper bounds converge wihin 1 % olerance a 1 s ieraion of algorihm BARON (Sahinidis, 1996) could no find global soluion in more han 10 hours* * Penium IV, 2.8 GHz, 512 MB RAM 21
22 Fuure work 1. Consider addiion of RLT consrains o srenghen maser problem 2. Consider global soluion of NLP subproblems 3. Increase model accuracy 4. Exend ime horizon 5. Inegraion wih downsream refinery 22
Global Optimization for Scheduling Refinery Crude Oil Operations
Global Opimizaion for Scheduling Refinery Crude Oil Operaions Ramkumar Karuppiah 1, Kevin C. Furman 2 and Ignacio E. Grossmann 1 (1) Deparmen of Chemical Engineering Carnegie Mellon Universiy (2) Corporae
More informationCrude oil scheduling optimization including specific operational aspects of a Brazilian refinery.
Crude oil scheduling opimizaion including specific operaional aspecs of a Brazilian refinery. Raiana R. Seixas, Valéria V. Muraa, Sérgio M. S. Neiro Federal Universiy of Uberlândia - Uberlândia MG Brazil
More informationAn introduction to the theory of SDDP algorithm
An inroducion o he heory of SDDP algorihm V. Leclère (ENPC) Augus 1, 2014 V. Leclère Inroducion o SDDP Augus 1, 2014 1 / 21 Inroducion Large scale sochasic problem are hard o solve. Two ways of aacking
More informationVehicle Arrival Models : Headway
Chaper 12 Vehicle Arrival Models : Headway 12.1 Inroducion Modelling arrival of vehicle a secion of road is an imporan sep in raffic flow modelling. I has imporan applicaion in raffic flow simulaion where
More informationINTEGRATION OF SCHEDULING AND CONTROLLER DESIGN FOR A MULTIPRODUCT CSTR
ITEGRATIO OF SCHEDULIG AD COTROLLER DESIG FOR A MULTIPRODUCT CSTR Yunfei Chu, Fengqi You orhwesern Universiy 245 Sheridan Road, Evanson, IL 628 Absrac Though scheduling and conrol are radiionally considered
More informationCENTRALIZED VERSUS DECENTRALIZED PRODUCTION PLANNING IN SUPPLY CHAINS
CENRALIZED VERSUS DECENRALIZED PRODUCION PLANNING IN SUPPLY CHAINS Georges SAHARIDIS* a, Yves DALLERY* a, Fikri KARAESMEN* b * a Ecole Cenrale Paris Deparmen of Indusial Engineering (LGI), +3343388, saharidis,dallery@lgi.ecp.fr
More informationOn a Discrete-In-Time Order Level Inventory Model for Items with Random Deterioration
Journal of Agriculure and Life Sciences Vol., No. ; June 4 On a Discree-In-Time Order Level Invenory Model for Iems wih Random Deerioraion Dr Biswaranjan Mandal Associae Professor of Mahemaics Acharya
More informationA Simultaneous Optimization Approach for Off-line Blending and Scheduling of Oil-refinery Operations
A Simulaneous Opimizaion Approach for Off-line Blending and Scheduling of Oil-refinery Operaions Carlos A. Mendez gnacio E. Grossmann Deparmen of Chemical Engineering - Carnegie Mellon Universiy Pisburgh
More informationT L. t=1. Proof of Lemma 1. Using the marginal cost accounting in Equation(4) and standard arguments. t )+Π RB. t )+K 1(Q RB
Elecronic Companion EC.1. Proofs of Technical Lemmas and Theorems LEMMA 1. Le C(RB) be he oal cos incurred by he RB policy. Then we have, T L E[C(RB)] 3 E[Z RB ]. (EC.1) Proof of Lemma 1. Using he marginal
More informationUnit Commitment under Market Equilibrium Constraints
Uni Commimen under Marke Equilibrium Consrains Luce Brocorne 1 Fabio D Andreagiovanni 2 Jérôme De Boeck 3,1 Bernard Forz 3,1 1 INOCS, INRIA Lille Nord-Europe, France 2 Universié de Technologie de Compiègne,
More informationLAPLACE TRANSFORM AND TRANSFER FUNCTION
CHBE320 LECTURE V LAPLACE TRANSFORM AND TRANSFER FUNCTION Professor Dae Ryook Yang Spring 2018 Dep. of Chemical and Biological Engineering 5-1 Road Map of he Lecure V Laplace Transform and Transfer funcions
More informationOperating Systems Exercise 3
Operaing Sysems SS 00 Universiy of Zurich Operaing Sysems Exercise 3 00-06-4 Dominique Emery, s97-60-056 Thomas Bocek, s99-706-39 Philip Iezzi, s99-74-354 Florian Caflisch, s96-90-55 Table page Table page
More informationA Shooting Method for A Node Generation Algorithm
A Shooing Mehod for A Node Generaion Algorihm Hiroaki Nishikawa W.M.Keck Foundaion Laboraory for Compuaional Fluid Dynamics Deparmen of Aerospace Engineering, Universiy of Michigan, Ann Arbor, Michigan
More informationSolutions for Assignment 2
Faculy of rs and Science Universiy of Torono CSC 358 - Inroducion o Compuer Neworks, Winer 218 Soluions for ssignmen 2 Quesion 1 (2 Poins): Go-ack n RQ In his quesion, we review how Go-ack n RQ can be
More informationTimed Circuits. Asynchronous Circuit Design. Timing Relationships. A Simple Example. Timed States. Timing Sequences. ({r 6 },t6 = 1.
Timed Circuis Asynchronous Circui Design Chris J. Myers Lecure 7: Timed Circuis Chaper 7 Previous mehods only use limied knowledge of delays. Very robus sysems, bu exremely conservaive. Large funcional
More informationApplying Genetic Algorithms for Inventory Lot-Sizing Problem with Supplier Selection under Storage Capacity Constraints
IJCSI Inernaional Journal of Compuer Science Issues, Vol 9, Issue 1, No 1, January 2012 wwwijcsiorg 18 Applying Geneic Algorihms for Invenory Lo-Sizing Problem wih Supplier Selecion under Sorage Capaciy
More informationA Primal-Dual Type Algorithm with the O(1/t) Convergence Rate for Large Scale Constrained Convex Programs
PROC. IEEE CONFERENCE ON DECISION AND CONTROL, 06 A Primal-Dual Type Algorihm wih he O(/) Convergence Rae for Large Scale Consrained Convex Programs Hao Yu and Michael J. Neely Absrac This paper considers
More informationOrder Reduction of Large Scale DAE Models. J.D. Hedengren and T. F. Edgar Department of Chemical Engineering The University of Texas at Austin
Order Reducion of Large Scale DAE Models J.D. Hedengren and T. F. Edgar Deparmen of Chemical Engineering The Universiy of Teas a Ausin 1 Ouline Moivaion Two Sep Process for DAE Model Reducion 1. Reducion
More informationChapter 3 Boundary Value Problem
Chaper 3 Boundary Value Problem A boundary value problem (BVP) is a problem, ypically an ODE or a PDE, which has values assigned on he physical boundary of he domain in which he problem is specified. Le
More information3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon
3..3 INRODUCION O DYNAMIC OPIMIZAION: DISCREE IME PROBLEMS A. he Hamilonian and Firs-Order Condiions in a Finie ime Horizon Define a new funcion, he Hamilonian funcion, H. H he change in he oal value of
More informationZürich. ETH Master Course: L Autonomous Mobile Robots Localization II
Roland Siegwar Margaria Chli Paul Furgale Marco Huer Marin Rufli Davide Scaramuzza ETH Maser Course: 151-0854-00L Auonomous Mobile Robos Localizaion II ACT and SEE For all do, (predicion updae / ACT),
More informationMODULE - 9 LECTURE NOTES 2 GENETIC ALGORITHMS
1 MODULE - 9 LECTURE NOTES 2 GENETIC ALGORITHMS INTRODUCTION Mos real world opimizaion problems involve complexiies like discree, coninuous or mixed variables, muliple conflicing objecives, non-lineariy,
More informationSolutions to Assignment 1
MA 2326 Differenial Equaions Insrucor: Peronela Radu Friday, February 8, 203 Soluions o Assignmen. Find he general soluions of he following ODEs: (a) 2 x = an x Soluion: I is a separable equaion as we
More informationA Hop Constrained Min-Sum Arborescence with Outage Costs
A Hop Consrained Min-Sum Arborescence wih Ouage Coss Rakesh Kawara Minnesoa Sae Universiy, Mankao, MN 56001 Email: Kawara@mnsu.edu Absrac The hop consrained min-sum arborescence wih ouage coss problem
More informationCHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK
175 CHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK 10.1 INTRODUCTION Amongs he research work performed, he bes resuls of experimenal work are validaed wih Arificial Neural Nework. From he
More informationComputational Strategies for Non-convex Multistage MINLP Models with Decision-Dependent Uncertainty and Gradual Uncertainty Resolution
Manuscrip Click here o download Manuscrip: Paper.ps Click here o view linked References 1 1 1 1 1 0 1 0 1 0 1 0 1 0 1 Compuaional Sraegies for Non-convex Mulisage MINLP Models wih Decision-Dependen Uncerainy
More informationSimulation-Solving Dynamic Models ABE 5646 Week 2, Spring 2010
Simulaion-Solving Dynamic Models ABE 5646 Week 2, Spring 2010 Week Descripion Reading Maerial 2 Compuer Simulaion of Dynamic Models Finie Difference, coninuous saes, discree ime Simple Mehods Euler Trapezoid
More informationOptimal Path Planning for Flexible Redundant Robot Manipulators
25 WSEAS In. Conf. on DYNAMICAL SYSEMS and CONROL, Venice, Ialy, November 2-4, 25 (pp363-368) Opimal Pah Planning for Flexible Redundan Robo Manipulaors H. HOMAEI, M. KESHMIRI Deparmen of Mechanical Engineering
More informationScheduling of oil-refinery operations
Felipe Díaz-Alvarado 2, Francisco Trespalacios 1, Ignacio Grossmann 1 1 Center for Advanced Process Decision-making. Carnegie Mellon University 2 Department of Chemical and Biotechnological Engineering.
More informationCHE302 LECTURE IV MATHEMATICAL MODELING OF CHEMICAL PROCESS. Professor Dae Ryook Yang
CHE302 LECTURE IV MATHEMATICAL MODELING OF CHEMICAL PROCESS Professor Dae Ryook Yang Fall 200 Dep. of Chemical and Biological Engineering Korea Universiy CHE302 Process Dynamics and Conrol Korea Universiy
More information2.4 Cuk converter example
2.4 Cuk converer example C 1 Cuk converer, wih ideal swich i 1 i v 1 2 1 2 C 2 v 2 Cuk converer: pracical realizaion using MOSFET and diode C 1 i 1 i v 1 2 Q 1 D 1 C 2 v 2 28 Analysis sraegy This converer
More informationVariational Iteration Method for Solving System of Fractional Order Ordinary Differential Equations
IOSR Journal of Mahemaics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 1, Issue 6 Ver. II (Nov - Dec. 214), PP 48-54 Variaional Ieraion Mehod for Solving Sysem of Fracional Order Ordinary Differenial
More informationCHBE320 LECTURE IV MATHEMATICAL MODELING OF CHEMICAL PROCESS. Professor Dae Ryook Yang
CHBE320 LECTURE IV MATHEMATICAL MODELING OF CHEMICAL PROCESS Professor Dae Ryook Yang Spring 208 Dep. of Chemical and Biological Engineering CHBE320 Process Dynamics and Conrol 4- Road Map of he Lecure
More informationSecond Law. first draft 9/23/04, second Sept Oct 2005 minor changes 2006, used spell check, expanded example
Second Law firs draf 9/3/4, second Sep Oc 5 minor changes 6, used spell check, expanded example Kelvin-Planck: I is impossible o consruc a device ha will operae in a cycle and produce no effec oher han
More informationLecture 2 October ε-approximation of 2-player zero-sum games
Opimizaion II Winer 009/10 Lecurer: Khaled Elbassioni Lecure Ocober 19 1 ε-approximaion of -player zero-sum games In his lecure we give a randomized ficiious play algorihm for obaining an approximae soluion
More informationTechnical Report Doc ID: TR March-2013 (Last revision: 23-February-2016) On formulating quadratic functions in optimization models.
Technical Repor Doc ID: TR--203 06-March-203 (Las revision: 23-Februar-206) On formulaing quadraic funcions in opimizaion models. Auhor: Erling D. Andersen Convex quadraic consrains quie frequenl appear
More informationChapter 2. Models, Censoring, and Likelihood for Failure-Time Data
Chaper 2 Models, Censoring, and Likelihood for Failure-Time Daa William Q. Meeker and Luis A. Escobar Iowa Sae Universiy and Louisiana Sae Universiy Copyrigh 1998-2008 W. Q. Meeker and L. A. Escobar. Based
More informationAppendix to Online l 1 -Dictionary Learning with Application to Novel Document Detection
Appendix o Online l -Dicionary Learning wih Applicaion o Novel Documen Deecion Shiva Prasad Kasiviswanahan Huahua Wang Arindam Banerjee Prem Melville A Background abou ADMM In his secion, we give a brief
More informationMath 333 Problem Set #2 Solution 14 February 2003
Mah 333 Problem Se #2 Soluion 14 February 2003 A1. Solve he iniial value problem dy dx = x2 + e 3x ; 2y 4 y(0) = 1. Soluion: This is separable; we wrie 2y 4 dy = x 2 + e x dx and inegrae o ge The iniial
More informationApplication of a Stochastic-Fuzzy Approach to Modeling Optimal Discrete Time Dynamical Systems by Using Large Scale Data Processing
Applicaion of a Sochasic-Fuzzy Approach o Modeling Opimal Discree Time Dynamical Sysems by Using Large Scale Daa Processing AA WALASZE-BABISZEWSA Deparmen of Compuer Engineering Opole Universiy of Technology
More informationAn Optimal Dynamic Generation Scheduling for a Wind-Thermal Power System *
Energy and Power Engineering, 2013, 5, 1016-1021 doi:10.4236/epe.2013.54b194 Published Online July 2013 (hp://www.scirp.org/journal/epe) An Opimal Dynamic Generaion Scheduling for a Wind-Thermal Power
More informationRC, RL and RLC circuits
Name Dae Time o Complee h m Parner Course/ Secion / Grade RC, RL and RLC circuis Inroducion In his experimen we will invesigae he behavior of circuis conaining combinaions of resisors, capaciors, and inducors.
More informationInternational Journal of Computer Science Trends and Technology (IJCST) Volume 3 Issue 6, Nov-Dec 2015
Inernaional Journal of Compuer Science Trends and Technology (IJCST) Volume Issue 6, Nov-Dec 05 RESEARCH ARTICLE OPEN ACCESS An EPQ Model for Two-Parameer Weibully Deerioraed Iems wih Exponenial Demand
More informationInventory Control of Perishable Items in a Two-Echelon Supply Chain
Journal of Indusrial Engineering, Universiy of ehran, Special Issue,, PP. 69-77 69 Invenory Conrol of Perishable Iems in a wo-echelon Supply Chain Fariborz Jolai *, Elmira Gheisariha and Farnaz Nojavan
More informationMaintenance Models. Prof. Robert C. Leachman IEOR 130, Methods of Manufacturing Improvement Spring, 2011
Mainenance Models Prof Rober C Leachman IEOR 3, Mehods of Manufacuring Improvemen Spring, Inroducion The mainenance of complex equipmen ofen accouns for a large porion of he coss associaed wih ha equipmen
More informationThis document was generated at 1:04 PM, 09/10/13 Copyright 2013 Richard T. Woodward. 4. End points and transversality conditions AGEC
his documen was generaed a 1:4 PM, 9/1/13 Copyrigh 213 Richard. Woodward 4. End poins and ransversaliy condiions AGEC 637-213 F z d Recall from Lecure 3 ha a ypical opimal conrol problem is o maimize (,,
More informationEE650R: Reliability Physics of Nanoelectronic Devices Lecture 9:
EE65R: Reliabiliy Physics of anoelecronic Devices Lecure 9: Feaures of Time-Dependen BTI Degradaion Dae: Sep. 9, 6 Classnoe Lufe Siddique Review Animesh Daa 9. Background/Review: BTI is observed when he
More informationSOLUTIONS TO ECE 3084
SOLUTIONS TO ECE 384 PROBLEM 2.. For each sysem below, specify wheher or no i is: (i) memoryless; (ii) causal; (iii) inverible; (iv) linear; (v) ime invarian; Explain your reasoning. If he propery is no
More informationLecture 20: Riccati Equations and Least Squares Feedback Control
34-5 LINEAR SYSTEMS Lecure : Riccai Equaions and Leas Squares Feedback Conrol 5.6.4 Sae Feedback via Riccai Equaions A recursive approach in generaing he marix-valued funcion W ( ) equaion for i for he
More informationParticle Swarm Optimization Combining Diversification and Intensification for Nonlinear Integer Programming Problems
Paricle Swarm Opimizaion Combining Diversificaion and Inensificaion for Nonlinear Ineger Programming Problems Takeshi Masui, Masaoshi Sakawa, Kosuke Kao and Koichi Masumoo Hiroshima Universiy 1-4-1, Kagamiyama,
More informationOptima and Equilibria for Traffic Flow on a Network
Opima and Equilibria for Traffic Flow on a Nework Albero Bressan Deparmen of Mahemaics, Penn Sae Universiy bressan@mah.psu.edu Albero Bressan (Penn Sae) Opima and equilibria for raffic flow 1 / 1 A Traffic
More informationDesign of a control system
SE3 Prof. Davide Manca Poliecnico di Milano Dynamics and Conrol of Chemical Processes Soluion o Lab #3 Design of a conrol sysem Davide Manca Dynamics and Conrol of Chemical Processes Maser Degree in ChemEng
More informationR.#W.#Erickson# Department#of#Electrical,#Computer,#and#Energy#Engineering# University#of#Colorado,#Boulder#
.#W.#Erickson# Deparmen#of#Elecrical,#Compuer,#and#Energy#Engineering# Universiy#of#Colorado,#Boulder# Chaper 2 Principles of Seady-Sae Converer Analysis 2.1. Inroducion 2.2. Inducor vol-second balance,
More informationComments on Window-Constrained Scheduling
Commens on Window-Consrained Scheduling Richard Wes Member, IEEE and Yuing Zhang Absrac This shor repor clarifies he behavior of DWCS wih respec o Theorem 3 in our previously published paper [1], and describes
More informationMULTI-PERIOD PRODUCTION PLANNING UNDER FUZZY CONDITIONS
hp://dx.doi.org/.474/apem.. Advances in Producion Engineering & Managemen 7 (), 6-7 ISSN 854-65 Scienific paper MULTI-PERIOD PRODUCTION PLANNING UNDER FUY CONDITIONS Naadimuhu, G.; Liu, Y.L. & Lee, E.S.
More informationCourse Notes for EE227C (Spring 2018): Convex Optimization and Approximation
Course Noes for EE7C Spring 018: Convex Opimizaion and Approximaion Insrucor: Moriz Hard Email: hard+ee7c@berkeley.edu Graduae Insrucor: Max Simchowiz Email: msimchow+ee7c@berkeley.edu Ocober 15, 018 3
More informationEnergy Storage Benchmark Problems
Energy Sorage Benchmark Problems Daniel F. Salas 1,3, Warren B. Powell 2,3 1 Deparmen of Chemical & Biological Engineering 2 Deparmen of Operaions Research & Financial Engineering 3 Princeon Laboraory
More informationKINEMATICS IN ONE DIMENSION
KINEMATICS IN ONE DIMENSION PREVIEW Kinemaics is he sudy of how hings move how far (disance and displacemen), how fas (speed and velociy), and how fas ha how fas changes (acceleraion). We say ha an objec
More informationEnergy-Efficient Link Adaptation on Parallel Channels
Energy-Efficien Link Adapaion on Parallel Channels Chrisian Isheden and Gerhard P. Feweis Technische Universiä Dresden Vodafone Chair Mobile Communicaions Sysems D-0069 Dresden Germany Email: (see hp://www.vodafone-chair.com/
More informationEmbedded Systems and Software. A Simple Introduction to Embedded Control Systems (PID Control)
Embedded Sysems and Sofware A Simple Inroducion o Embedded Conrol Sysems (PID Conrol) Embedded Sysems and Sofware, ECE:3360. The Universiy of Iowa, 2016 Slide 1 Acknowledgemens The maerial in his lecure
More informationSZG Macro 2011 Lecture 3: Dynamic Programming. SZG macro 2011 lecture 3 1
SZG Macro 2011 Lecure 3: Dynamic Programming SZG macro 2011 lecure 3 1 Background Our previous discussion of opimal consumpion over ime and of opimal capial accumulaion sugges sudying he general decision
More informationGuest Lectures for Dr. MacFarlane s EE3350 Part Deux
Gues Lecures for Dr. MacFarlane s EE3350 Par Deux Michael Plane Mon., 08-30-2010 Wrie name in corner. Poin ou his is a review, so I will go faser. Remind hem o go lisen o online lecure abou geing an A
More informationENV 6015 Solution to Mixing Problem Set
EN 65 Soluion o ixing Problem Se. A slug of dye ( ) is injeced ino a single ank wih coninuous mixing. The flow in and ou of he ank is.5 gpm. The ank volume is 5 gallons. When will he dye concenraion equal
More informationTwo-level lot-sizing with inventory bounds
Two-level lo-sizing wih invenory bounds Siao-Leu Phourasamay, Safia Kedad-Sidhoum, Fanny Pascual Sorbonne Universiés, UPMC Univ Paris 06, CNRS, LIP6 UMR 7606, 4 place Jussieu 75005 Paris. {siao-leu.phourasamay,safia.kedad-sidhoum,fanny.pascual}@lip6.fr
More informationSubway stations energy and air quality management
Subway saions energy and air qualiy managemen wih sochasic opimizaion Trisan Rigau 1,2,4, Advisors: P. Carpenier 3, J.-Ph. Chancelier 2, M. De Lara 2 EFFICACITY 1 CERMICS, ENPC 2 UMA, ENSTA 3 LISIS, IFSTTAR
More informationMean-square Stability Control for Networked Systems with Stochastic Time Delay
JOURNAL OF SIMULAION VOL. 5 NO. May 7 Mean-square Sabiliy Conrol for Newored Sysems wih Sochasic ime Delay YAO Hejun YUAN Fushun School of Mahemaics and Saisics Anyang Normal Universiy Anyang Henan. 455
More informationMoving Horizon Estimation for Staged QP Problems
51s IEEE Conference on Decision and Conrol, Maui, HI, December 212 Moving Horizon Esimaion for Saged QP Problems Eric Chu, Arezou Keshavarz, Dimiry Gorinevsky, and Sephen Boyd Absrac his paper considers
More informationSingle-Pass-Based Heuristic Algorithms for Group Flexible Flow-shop Scheduling Problems
Single-Pass-Based Heurisic Algorihms for Group Flexible Flow-shop Scheduling Problems PEI-YING HUANG, TZUNG-PEI HONG 2 and CHENG-YAN KAO, 3 Deparmen of Compuer Science and Informaion Engineering Naional
More informationAnalyze patterns and relationships. 3. Generate two numerical patterns using AC
envision ah 2.0 5h Grade ah Curriculum Quarer 1 Quarer 2 Quarer 3 Quarer 4 andards: =ajor =upporing =Addiional Firs 30 Day 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 andards: Operaions and Algebraic Thinking
More informationBU Macro BU Macro Fall 2008, Lecture 4
Dynamic Programming BU Macro 2008 Lecure 4 1 Ouline 1. Cerainy opimizaion problem used o illusrae: a. Resricions on exogenous variables b. Value funcion c. Policy funcion d. The Bellman equaion and an
More informationOnline Appendix to Solution Methods for Models with Rare Disasters
Online Appendix o Soluion Mehods for Models wih Rare Disasers Jesús Fernández-Villaverde and Oren Levinal In his Online Appendix, we presen he Euler condiions of he model, we develop he pricing Calvo block,
More informationRobust and Learning Control for Complex Systems
Robus and Learning Conrol for Complex Sysems Peer M. Young Sepember 13, 2007 & Talk Ouline Inroducion Robus Conroller Analysis and Design Theory Experimenal Applicaions Overview MIMO Robus HVAC Conrol
More informationBasic Circuit Elements Professor J R Lucas November 2001
Basic Circui Elemens - J ucas An elecrical circui is an inerconnecion of circui elemens. These circui elemens can be caegorised ino wo ypes, namely acive and passive elemens. Some Definiions/explanaions
More informationThe equation to any straight line can be expressed in the form:
Sring Graphs Par 1 Answers 1 TI-Nspire Invesigaion Suden min Aims Deermine a series of equaions of sraigh lines o form a paern similar o ha formed by he cables on he Jerusalem Chords Bridge. Deermine he
More information6.2 Transforms of Derivatives and Integrals.
SEC. 6.2 Transforms of Derivaives and Inegrals. ODEs 2 3 33 39 23. Change of scale. If l( f ()) F(s) and c is any 33 45 APPLICATION OF s-shifting posiive consan, show ha l( f (c)) F(s>c)>c (Hin: In Probs.
More informationTopic Astable Circuits. Recall that an astable circuit has two unstable states;
Topic 2.2. Asable Circuis. Learning Objecives: A he end o his opic you will be able o; Recall ha an asable circui has wo unsable saes; Explain he operaion o a circui based on a Schmi inverer, and esimae
More informationAPPLICATIONS OF MATHEMATICAL PROGRAMMING TECHNIQUES FOR THE SYNTHESIS OF MASS INTEGRATION NETWORKS
APPLICATIONS OF MATHEMATICAL PROGRAMMING TECHNIQUES FOR THE SYNTHESIS OF MASS INTEGRATION NETWORKS Aruro Jiménez-Guiérrez Insiuo Tecnológico de Celaya Celaya GTO México July 21 2011 PASI 2011 PROCESS INTEGRATION
More informationTom Heskes and Onno Zoeter. Presented by Mark Buller
Tom Heskes and Onno Zoeer Presened by Mark Buller Dynamic Bayesian Neworks Direced graphical models of sochasic processes Represen hidden and observed variables wih differen dependencies Generalize Hidden
More informationConstant Acceleration
Objecive Consan Acceleraion To deermine he acceleraion of objecs moving along a sraigh line wih consan acceleraion. Inroducion The posiion y of a paricle moving along a sraigh line wih a consan acceleraion
More informationMatlab and Python programming: how to get started
Malab and Pyhon programming: how o ge sared Equipping readers he skills o wrie programs o explore complex sysems and discover ineresing paerns from big daa is one of he main goals of his book. In his chaper,
More informationReserves measures have an economic component eg. what could be extracted at current prices?
3.2 Non-renewable esources A. Are socks of non-renewable resources fixed? eserves measures have an economic componen eg. wha could be exraced a curren prices? - Locaion and quaniies of reserves of resources
More informationInventory Analysis and Management. Multi-Period Stochastic Models: Optimality of (s, S) Policy for K-Convex Objective Functions
Muli-Period Sochasic Models: Opimali of (s, S) Polic for -Convex Objecive Funcions Consider a seing similar o he N-sage newsvendor problem excep ha now here is a fixed re-ordering cos (> 0) for each (re-)order.
More informationUniversity of Oklahoma, 100 E. Boyd Street, T-335, Norman, Oklahoma Y it )
8136 Ind. Eng. Chem. Res. 2005, 44, 8136-8146 On a New MILP Model for he Planning of Hea-Exchanger Nework Cleaning. Par III: Muliperiod Cleaning under Uncerainy wih Financial Risk Managemen Javier H. Lavaja
More information2.7. Some common engineering functions. Introduction. Prerequisites. Learning Outcomes
Some common engineering funcions 2.7 Inroducion This secion provides a caalogue of some common funcions ofen used in Science and Engineering. These include polynomials, raional funcions, he modulus funcion
More informationPredictive route choice control of destination coded vehicles with mixed integer linear programming optimization
Delf Universiy of Technology Delf Cener for Sysems and Conrol Technical repor 09-030 Predicive roue choice conrol of desinaion coded vehicles wih mixed ineger linear programming opimizaion A.N. Tarău,
More informationChapter 2: Principles of steady-state converter analysis
Chaper 2 Principles of Seady-Sae Converer Analysis 2.1. Inroducion 2.2. Inducor vol-second balance, capacior charge balance, and he small ripple approximaion 2.3. Boos converer example 2.4. Cuk converer
More informationDecentralized Stochastic Control with Partial History Sharing: A Common Information Approach
1 Decenralized Sochasic Conrol wih Parial Hisory Sharing: A Common Informaion Approach Ashuosh Nayyar, Adiya Mahajan and Demoshenis Tenekezis arxiv:1209.1695v1 [cs.sy] 8 Sep 2012 Absrac A general model
More informationAge (x) nx lx. Age (x) nx lx dx qx
Life Tables Dynamic (horizonal) cohor= cohor followed hrough ime unil all members have died Saic (verical or curren) = one census period (day, season, ec.); only equivalen o dynamic if populaion does no
More informationBlock Diagram of a DCS in 411
Informaion source Forma A/D From oher sources Pulse modu. Muliplex Bandpass modu. X M h: channel impulse response m i g i s i Digial inpu Digial oupu iming and synchronizaion Digial baseband/ bandpass
More informationModal identification of structures from roving input data by means of maximum likelihood estimation of the state space model
Modal idenificaion of srucures from roving inpu daa by means of maximum likelihood esimaion of he sae space model J. Cara, J. Juan, E. Alarcón Absrac The usual way o perform a forced vibraion es is o fix
More informationt dt t SCLP Bellman (1953) CLP (Dantzig, Tyndall, Grinold, Perold, Anstreicher 60's-80's) Anderson (1978) SCLP
Coninuous Linear Programming. Separaed Coninuous Linear Programming Bellman (1953) max c () u() d H () u () + Gsusds (,) () a () u (), < < CLP (Danzig, yndall, Grinold, Perold, Ansreicher 6's-8's) Anderson
More informationChapter 15: Phenomena. Chapter 15 Chemical Kinetics. Reaction Rates. Reaction Rates R P. Reaction Rates. Rate Laws
Chaper 5: Phenomena Phenomena: The reacion (aq) + B(aq) C(aq) was sudied a wo differen emperaures (98 K and 35 K). For each emperaure he reacion was sared by puing differen concenraions of he 3 species
More informationThe field of mathematics has made tremendous impact on the study of
A Populaion Firing Rae Model of Reverberaory Aciviy in Neuronal Neworks Zofia Koscielniak Carnegie Mellon Universiy Menor: Dr. G. Bard Ermenrou Universiy of Pisburgh Inroducion: The field of mahemaics
More informationi L = VT L (16.34) 918a i D v OUT i L v C V - S 1 FIGURE A switched power supply circuit with diode and a switch.
16.4.3 A SWITHED POWER SUPPY USINGA DIODE In his example, we will analyze he behavior of he diodebased swiched power supply circui shown in Figure 16.15. Noice ha his circui is similar o ha in Figure 12.41,
More informationSupplement for Stochastic Convex Optimization: Faster Local Growth Implies Faster Global Convergence
Supplemen for Sochasic Convex Opimizaion: Faser Local Growh Implies Faser Global Convergence Yi Xu Qihang Lin ianbao Yang Proof of heorem heorem Suppose Assumpion holds and F (w) obeys he LGC (6) Given
More informationSeminar 4: Hotelling 2
Seminar 4: Hoelling 2 November 3, 211 1 Exercise Par 1 Iso-elasic demand A non renewable resource of a known sock S can be exraced a zero cos. Demand for he resource is of he form: D(p ) = p ε ε > A a
More information1. An introduction to dynamic optimization -- Optimal Control and Dynamic Programming AGEC
This documen was generaed a :45 PM 8/8/04 Copyrigh 04 Richard T. Woodward. An inroducion o dynamic opimizaion -- Opimal Conrol and Dynamic Programming AGEC 637-04 I. Overview of opimizaion Opimizaion is
More informationClass Meeting # 10: Introduction to the Wave Equation
MATH 8.5 COURSE NOTES - CLASS MEETING # 0 8.5 Inroducion o PDEs, Fall 0 Professor: Jared Speck Class Meeing # 0: Inroducion o he Wave Equaion. Wha is he wave equaion? The sandard wave equaion for a funcion
More informationRobust Learning Control with Application to HVAC Systems
Robus Learning Conrol wih Applicaion o HVAC Sysems Naional Science Foundaion & Projec Invesigaors: Dr. Charles Anderson, CS Dr. Douglas Hile, ME Dr. Peer Young, ECE Mechanical Engineering Compuer Science
More informationEconomics 8105 Macroeconomic Theory Recitation 6
Economics 8105 Macroeconomic Theory Reciaion 6 Conor Ryan Ocober 11h, 2016 Ouline: Opimal Taxaion wih Governmen Invesmen 1 Governmen Expendiure in Producion In hese noes we will examine a model in which
More information