Real time production optimization in upstream petroleum production - Applied to the Troll West oil rim
|
|
- Gerald Reeves
- 6 years ago
- Views:
Transcription
1 Real time production optimization in upstream petroleum production - Applied to the Troll West oil rim Vidar Gunnerud, Bjarne Foss Norwegian University of Science and Technology - NTNU Trondheim, Norway ( ) Outline 1. Problem formulation and today's solution methods and work process at Troll C 2. New Solution method: Dynamic piecewise linearization and Lagrangian decomposition 3. Troll West oil rim Initial results 1
2 Petroleum production - Decision horizons vary a lot Focus in this work Oilfield Review
3 Production optimization - Optimizing on a day-week horizon Typical optimization problem Maximize oil production while honoring constraints related to the underground hydrocarbon reservoir wells pipelines downstream processing equipment (separators, compressors,...) Decisions variables Production valve on each well (often between 10 and 100 wells) Gas injection valves (on some wells) Routing of the reservoir fluid (often a well may be routed to two different production lines) 3
4 Platform Sea bed Production optimization - Stylistic view Typical optimization problem One of eight Troll C clusters Maximize oil production while honoring constraints Decisions variables Production valve on each well Gas injection valves Routing of the reservoir fluid Under ground reservoir Typical system boundaries Upstream: Underground hydrocarbon reservoir Downstream: Inlet separator on downstream processing equipment 4
5 Production optimization - Challenges The optimization problem is a (large) nonlinear programming problem with integer variables Well models can be highly nonlinear Pressure drop models for pipelines are nonlinear Present optimization technology is a constraining factor for real-time production optimization 5
6 Today s solution methods GORM (Gas-Oil Ratio Model In-House model Simplified reservoir model Models gas coning Adjusted to each well Troll: 100 GORM models GAP (General allocation program) Commercial software Models the flow condition in the network and operational constraints Does not have an appropriate gas coning model Troll: 17 GAP models (clusters) 6 Ref. Duenas, 2007
7 Todays solution methods Production Data Wellbore Info GOR Prediction Optimal P, inj. rates Routing 7 Ref. Duenas, 2007
8 8 Today s solution methods The integrated tools
9 New methodological foundation Methodological foundation for our work Dynamic piecewise linearization To linearize the problem Lagrangian decomposition To split the problem 9
10 Piecewise linearization of Dynamic piecewise linearization - principle f ( x) = x 2 By a modal formulation a nonlinear function is transformed into a piecewise linear function At most two adjacent s can be non-zero Converts a NP problem to a MILP problem For Troll this means piecewise linear well performance curves piecewise linear pressure drop models 10
11 Dynamic piecewise linearization - principle Illustration of a dynamical piecewise linearized well performance curve To minimize error due to piecewise linearization, good accuracy and small intervals between interpolation coordinates are needed This again results in a large number of variables and will hence be computationally expensive To handle this, it is possible to dynamically insert interpolation coordinates in demanding areas 11
12 Dynamic piecewise linearization - principle Solves the problem only containing a small set of interpolation coordinates (coarse resolution) Locates the solution Inserts more interpolation coordinates in that area Re-optimizes Converges when acceptable accuracy close to the solution is achieved 12
13 Lagrangian decomposition (LD) is a method to decompose an optimization problem into two or more disjoint (and hence smaller) problems LD may be efficient for certain network-type problems Lagrangian decomposition principle Relax the comman constraint The LP problem can be decomposed provided the Lagrangian multiplier for the common constraint is known 13
14 To solve a Lagrangian decomposed problem is a iterative procedure Solve both problem with initial Lagrangian multipliers Check feasibility with respect to relaxed constraint Calculate new Lagrangian multipliers based on heuristic Feasible objective function give lower bound, Lagrangian function gives upper bound Lagrangian decomposition principle Relaxed constraint Objective function Lagrangian function 14
15 Constraint to relax gas processing constraint C GAS TOT Lagrangian decomposition Troll C j Clusters q GAS j One of eight Troll C clusters Lagrangian function augmenting the objective function with the common gas processing constraint OIL GAS GAS GAS Max _ Z = q λ ( C q ) j Clusters j TOT j j Clusters Objective for each cluster Max _ Z = q λ q OIL GAS GAS j j j Note: The overall optimization problem can be split into 8 (much) smaller problems! 15
16 Complete algorithm combining Dynamic piecewise linearization and Lagrangian decomposition Solves the problem for each cluster Calculates the total gas production Compare gas production with total gas capacity constraint Re-optimizes Converges when maximum oil production is found, while honoring the gas capacity constraint 16
17 17 Implementation
18 Troll C case and results Tested on two clusters (11 wells) plus pipeline system Results compared with results using GAP (commercial) software Results are promising Challenges numerical instability robustness Problem size are highly scalable (constraints , variables mill) Solution time, highly dependent of problem and problem size (5 min 10 hours) 18
19 Collabration with CMU Professor Erik Ydstie s group PhD student - Michael Wartmann They have developed an network based analysis of decision making in complex organizations Based on thermodynamics Basic conservation laws for assets and liabilities 19
20 Collabration with CMU This network based Methodological foundation will be apply to optimization in upstream petroleum production Troll C will be used as test case I will visit CMU Michael Wartmann has/will visit NTNU Professor Ydstie will visit NTNU on regular basis 20
21 Conclusions and further work New algorithm for production optimization has been developed Algorithm is based on a combination of Lagrangian decomposition and dynamic piecewise linearization of nonlinear models Preliminary test results are promising Focus will lie on further development of Dynamic piecewise linearization Different Lagranigan decomposition methods will be tested Troll C will be used as test case Consider dynamic well models Work will be continued in my PhD thesis project in cooperation with: Hydro (Marta D. Diez) Carnegie Mellon University (Professor Erik Ydstie), Industrial Economy and Technology Management NTNU (Bjørn Nygreen) And others (Dept. of Petroleum Engineering and Applied Geophysics) 21
Column Generation and its applications
Column Generation and its applications Murat Firat, dept. IE&IS, TU/e BPI Cluster meeting Outline Some real-life decision problems Standard formulations Basics of Column Generation Master formulations
More informationAvailable online at ScienceDirect. IFAC-PapersOnLine 48-6 (2015)
Available online at www.sciencedirect.com ScienceDirect IFAC-PapersOnLine 48-6 (2015) 001 008 Production Optimization Facilitated by Divide and Conquer Strategies Bjarne Foss Bjarne Grimstad Vidar Gunnerud
More informationImproving Dual Bound for Stochastic MILP Models Using Sensitivity Analysis
Improving Dual Bound for Stochastic MILP Models Using Sensitivity Analysis Vijay Gupta Ignacio E. Grossmann Department of Chemical Engineering Carnegie Mellon University, Pittsburgh Bora Tarhan ExxonMobil
More informationSurrogate Gradient Algorithm for Lagrangian Relaxation 1,2
Surrogate Gradient Algorithm for Lagrangian Relaxation 1,2 X. Zhao 3, P. B. Luh 4, and J. Wang 5 Communicated by W.B. Gong and D. D. Yao 1 This paper is dedicated to Professor Yu-Chi Ho for his 65th birthday.
More information15.082J and 6.855J. Lagrangian Relaxation 2 Algorithms Application to LPs
15.082J and 6.855J Lagrangian Relaxation 2 Algorithms Application to LPs 1 The Constrained Shortest Path Problem (1,10) 2 (1,1) 4 (2,3) (1,7) 1 (10,3) (1,2) (10,1) (5,7) 3 (12,3) 5 (2,2) 6 Find the shortest
More informationUse of Time-Varying Oil Price in Short-term Production Optimization for a Reservoir
Preprints of the 1th IFAC International Symposium on Dynamics and Control of Process Systems The International Federation of Automatic Control December 18-2, 213. Mumbai, India Use of Time-Varying Oil
More informationPolyhedral Compilation Foundations
Polyhedral Compilation Foundations Louis-Noël Pouchet pouchet@cse.ohio-state.edu Dept. of Computer Science and Engineering, the Ohio State University Feb 22, 2010 888.11, Class #5 Introduction: Polyhedral
More informationConvex Optimization and Machine Learning
Convex Optimization and Machine Learning Mengliu Zhao Machine Learning Reading Group School of Computing Science Simon Fraser University March 12, 2014 Mengliu Zhao SFU-MLRG March 12, 2014 1 / 25 Introduction
More informationASHORT product design cycle is critical for manufacturers
394 IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, VOL. 5, NO. 3, JULY 2008 An Optimization-Based Approach for Design Project Scheduling Ming Ni, Peter B. Luh, Fellow, IEEE, and Bryan Moser Abstract
More informationROBUST TUNING TO IMPROVE SPEED AND MAINTAIN ACCURACY OF FLOW SIMULATION. OPM summit October, Bergen Rohith Nair
ROBUST TUNING TO IMPROVE SPEED AND MAINTAIN ACCURACY OF FLOW SIMULATION OPM summit 18-19 October, Bergen Rohith Nair OVERVIEW Introduction Model tuning as an optimization problem Methodology Experiments
More informationLagrangean Methods bounding through penalty adjustment
Lagrangean Methods bounding through penalty adjustment thst@man.dtu.dk DTU-Management Technical University of Denmark 1 Outline Brief introduction How to perform Lagrangean relaxation Subgradient techniques
More informationOptimal Network Flow Allocation. EE 384Y Almir Mutapcic and Primoz Skraba 27/05/2004
Optimal Network Flow Allocation EE 384Y Almir Mutapcic and Primoz Skraba 27/05/2004 Problem Statement Optimal network flow allocation Find flow allocation which minimizes certain performance criterion
More informationIntegral equation method for anisotropic inversion of towed streamer EM data: theory and application for the TWOP survey
Integral equation method for anisotropic inversion of towed streamer EM data: theory and application for the TWOP survey Michael S. Zhdanov 1,2, Masashi Endo 1, Daeung Yoon 1,2, Johan Mattsson 3, and Jonathan
More informationA set-based approach to robust control and verification of piecewise affine systems subject to safety specifications
Dipartimento di Elettronica, Informazione e Bioingegneria A set-based approach to robust control and verification of piecewise affine systems subject to safety specifications Maria Prandini maria.prandini@polimi.it
More informationBatch Scheduling of MultiProduct Pipeline Networks
Batch Scheduling of MultiProduct Pipeline Networks Delft Center for Systems and Control Batch Scheduling of Multi- Product Pipeline Networks For the degree of Master of Science in Systems and Control
More informationNOTATION AND TERMINOLOGY
15.053x, Optimization Methods in Business Analytics Fall, 2016 October 4, 2016 A glossary of notation and terms used in 15.053x Weeks 1, 2, 3, 4 and 5. (The most recent week's terms are in blue). NOTATION
More informationMINLP applications, part II: Water Network Design and some applications of black-box optimization
MINLP applications, part II: Water Network Design and some applications of black-box optimization Claudia D Ambrosio CNRS & LIX, École Polytechnique dambrosio@lix.polytechnique.fr 5th Porto Meeting on
More informationSolving a Network Flow Decision Problem with Sampled Nonlinearities
Solving a Network Flow Decision Problem with Sampled Nonlinearities Anders Thoresen Sandnes Master of Science in Engineering Cybernetics Submission date: June 2013 Supervisor: Bjarne Anton Foss, ITK Norwegian
More informationObject Oriented Simulation of Multiphase Flow
Object Oriented Simulation of Multiphase Flow P.Klebert and O.J.Nydal Norwegian University of Science and Technology (NTNU) 7491 Trondheim Norway Abstract Pipelines in offshore oil and gas production systems
More informationS0432 NEW IDEAS FOR MASSIVELY PARALLEL PRECONDITIONERS
S0432 NEW IDEAS FOR MASSIVELY PARALLEL PRECONDITIONERS John R Appleyard Jeremy D Appleyard Polyhedron Software with acknowledgements to Mark A Wakefield Garf Bowen Schlumberger Outline of Talk Reservoir
More informationME 555: Distributed Optimization
ME 555: Distributed Optimization Duke University Spring 2015 1 Administrative Course: ME 555: Distributed Optimization (Spring 2015) Instructor: Time: Location: Office hours: Website: Soomin Lee (email:
More informationLagrangean relaxation - exercises
Lagrangean relaxation - exercises Giovanni Righini Set covering We start from the following Set Covering Problem instance: min z = x + 2x 2 + x + 2x 4 + x 5 x + x 2 + x 4 x 2 + x x 2 + x 4 + x 5 x + x
More informationParallel Branch & Bound
Parallel Branch & Bound Bernard Gendron Université de Montréal gendron@iro.umontreal.ca Outline Mixed integer programming (MIP) and branch & bound (B&B) Linear programming (LP) based B&B Relaxation and
More informationSPE Distinguished Lecturer Program
SPE Distinguished Lecturer Program Primary funding is provided by The SPE Foundation through member donations and a contribution from Offshore Europe The Society is grateful to those companies that allow
More informationOutline. Column Generation: Cutting Stock A very applied method. Introduction to Column Generation. Given an LP problem
Column Generation: Cutting Stock A very applied method thst@man.dtu.dk Outline History The Simplex algorithm (re-visited) Column Generation as an extension of the Simplex algorithm A simple example! DTU-Management
More informationColumn Generation: Cutting Stock
Column Generation: Cutting Stock A very applied method thst@man.dtu.dk DTU-Management Technical University of Denmark 1 Outline History The Simplex algorithm (re-visited) Column Generation as an extension
More informationLecture 4 Duality and Decomposition Techniques
Lecture 4 Duality and Decomposition Techniques Jie Lu (jielu@kth.se) Richard Combes Alexandre Proutiere Automatic Control, KTH September 19, 2013 Consider the primal problem Lagrange Duality Lagrangian
More informationDISTRIBUTED NETWORK RESOURCE ALLOCATION WITH INTEGER CONSTRAINTS. Yujiao Cheng, Houfeng Huang, Gang Wu, Qing Ling
DISTRIBUTED NETWORK RESOURCE ALLOCATION WITH INTEGER CONSTRAINTS Yuao Cheng, Houfeng Huang, Gang Wu, Qing Ling Department of Automation, University of Science and Technology of China, Hefei, China ABSTRACT
More informationIntroduction to Mathematical Programming IE406. Lecture 20. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 20 Dr. Ted Ralphs IE406 Lecture 20 1 Reading for This Lecture Bertsimas Sections 10.1, 11.4 IE406 Lecture 20 2 Integer Linear Programming An integer
More informationProgramming, numerics and optimization
Programming, numerics and optimization Lecture C-4: Constrained optimization Łukasz Jankowski ljank@ippt.pan.pl Institute of Fundamental Technological Research Room 4.32, Phone +22.8261281 ext. 428 June
More informationThe Size Robust Multiple Knapsack Problem
MASTER THESIS ICA-3251535 The Size Robust Multiple Knapsack Problem Branch and Price for the Separate and Combined Recovery Decomposition Model Author: D.D. Tönissen, Supervisors: dr. ir. J.M. van den
More informationModule 1 Lecture Notes 2. Optimization Problem and Model Formulation
Optimization Methods: Introduction and Basic concepts 1 Module 1 Lecture Notes 2 Optimization Problem and Model Formulation Introduction In the previous lecture we studied the evolution of optimization
More informationMathematical and Algorithmic Foundations Linear Programming and Matchings
Adavnced Algorithms Lectures Mathematical and Algorithmic Foundations Linear Programming and Matchings Paul G. Spirakis Department of Computer Science University of Patras and Liverpool Paul G. Spirakis
More informationSMART WELL MODELLING. Design, Scenarios and Optimisation
Page 1 Introduction Smart or complex wells are in increasing use by operators as reservoir environments become more challenging. The wells include a number of smart devices installed to achieve a variety
More informationand 6.855J Lagrangian Relaxation I never missed the opportunity to remove obstacles in the way of unity. Mohandas Gandhi
15.082 and 6.855J Lagrangian Relaxation I never missed the opportunity to remove obstacles in the way of unity. Mohandas Gandhi On bounding in optimization In solving network flow problems, we not only
More informationFast Method for Maximum-Flow Problem with Minimum-Lot Sizes
Fast Method for Maximum-Flow Problem with Minimum-Lot Sizes Submitted by Vithya Ganeshan In partial fulfillment of Master of Science in Informatics University of Bergen, Bergen, Norway March 3, 2015 Supervised
More informationRobust validation of network designs under uncertain demands and failures
Robust validation of network designs under uncertain demands and failures Yiyang Chang, Sanjay Rao, and Mohit Tawarmalani Purdue University USENIX NSDI 2017 Validating network design Network design today
More informationAn Introduction to Dual Ascent Heuristics
An Introduction to Dual Ascent Heuristics Introduction A substantial proportion of Combinatorial Optimisation Problems (COPs) are essentially pure or mixed integer linear programming. COPs are in general
More informationFundamentals of Integer Programming
Fundamentals of Integer Programming Di Yuan Department of Information Technology, Uppsala University January 2018 Outline Definition of integer programming Formulating some classical problems with integer
More informationAli Abur Northeastern University Department of Electrical and Computer Engineering Boston, MA 02115
Enhanced State t Estimation Ali Abur Northeastern University Department of Electrical and Computer Engineering Boston, MA 02115 GCEP Workshop: Advanced Electricity Infrastructure Frances Arriallaga Alumni
More informationRate-Distortion Optimized Streaming of. Mohamed Hefeeda & ChengHsin Hsu
School of Computing Science Simon Fraser University, Canada Rate-Distortion Optimized Streaming of Fine-Grained Scalable Video Sequences Mohamed Hefeeda & ChengHsin Hsu MMCN 2007 31 January 2007 1 Motivations
More informationMixed Integer Non-linear Optimization for Crude Oil Scheduling
Mixed Integer Non-linear Optimization for Crude Oil Scheduling Ramkumar Karuppiah and Ignacio E. Grossmann niversit Enterprise-wide Optimization Project Introduction Purchasing and Scheduling of crude
More informationA robust optimization based approach to the general solution of mp-milp problems
21 st European Symposium on Computer Aided Process Engineering ESCAPE 21 E.N. Pistikopoulos, M.C. Georgiadis and A. Kokossis (Editors) 2011 Elsevier B.V. All rights reserved. A robust optimization based
More informationAbstract The generation of a reservoir development plan with well locations, given a reservoir property map and a set of infrastructure constraints, r
Optimal Location of Vertical Wells: A Decomposition Approach M.G. Ierapetritou and C.A. Floudas 1 Department of Chemical Engineering, Princeton University, Princeton, NJ 08544 S. Vasantharajan and A.S.
More informationRecursive column generation for the Tactical Berth Allocation Problem
Recursive column generation for the Tactical Berth Allocation Problem Ilaria Vacca 1 Matteo Salani 2 Michel Bierlaire 1 1 Transport and Mobility Laboratory, EPFL, Lausanne, Switzerland 2 IDSIA, Lugano,
More informationDynamic Content Allocation for Cloudassisted Service of Periodic Workloads
Dynamic Content Allocation for Cloudassisted Service of Periodic Workloads György Dán Royal Institute of Technology (KTH) Niklas Carlsson Linköping University @ IEEE INFOCOM 2014, Toronto, Canada, April/May
More informationThe Alternating Direction Method of Multipliers
The Alternating Direction Method of Multipliers With Adaptive Step Size Selection Peter Sutor, Jr. Project Advisor: Professor Tom Goldstein October 8, 2015 1 / 30 Introduction Presentation Outline 1 Convex
More informationNUMERICAL INVESTIGATION OF THE FLOW BEHAVIOR INTO THE INLET GUIDE VANE SYSTEM (IGV)
University of West Bohemia» Department of Power System Engineering NUMERICAL INVESTIGATION OF THE FLOW BEHAVIOR INTO THE INLET GUIDE VANE SYSTEM (IGV) Publication was supported by project: Budování excelentního
More informationEAS Resources User Guide. November 2015
November 2015 Table of Contents Contents What is EAS? 1 When you complete Schedule 1 21 EAS support 2 Resources application forms 21 EAS AdministratorError! Bookmark not defined. Resources application
More informationCHAPTER 8 DISCUSSIONS
153 CHAPTER 8 DISCUSSIONS This chapter discusses the developed models, methodologies to solve the developed models, performance of the developed methodologies and their inferences. 8.1 MULTI-PERIOD FIXED
More informationShort-term Production Optimization of Offshore Oil and Gas Production Using Nonlinear Model Predictive Control
Short-term Production Optimization of Offshore Oil and Gas Production Using Nonlinear Model Predictive Control Anders Willersrud Lars Imsland Svein Olav Hauger Pål Kittilsen Department of Engineering Cybernetics,
More informationA new hybrid slurry CFD model compared with experimental results
12th OpenFOAM Workshop, University of Exeter 24th-27th July 2017 A new hybrid slurry CFD model compared with experimental results Alasdair Mackenzie 1, Vanja Škurić 2, MT Stickland 1, WM Dempster 1 1.
More informationAnalysis and optimization methods of graph based meta-models for data flow simulation
Rochester Institute of Technology RIT Scholar Works Theses Thesis/Dissertation Collections 8-1-2010 Analysis and optimization methods of graph based meta-models for data flow simulation Jeffrey Harrison
More information/ Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang
600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang 9.1 Linear Programming Suppose we are trying to approximate a minimization
More informationToday. Golden section, discussion of error Newton s method. Newton s method, steepest descent, conjugate gradient
Optimization Last time Root finding: definition, motivation Algorithms: Bisection, false position, secant, Newton-Raphson Convergence & tradeoffs Example applications of Newton s method Root finding in
More informationTwo-stage column generation
Two-stage column generation A novel framework Ilaria Vacca and Matteo Salani Transport and Mobility Laboratory EPFL 6th Joint Operations Research Days September 12, 2008 Two stage column generation p.1/15
More informationUsing SAS/OR to Optimize Scheduling and Routing of Service Vehicles
Paper SAS1758-2018 Using SAS/OR to Optimize Scheduling and Routing of Service Vehicles Rob Pratt, SAS Institute Inc. ABSTRACT An oil company has a set of wells and a set of well operators. Each well has
More informationTh Volume Based Modeling - Automated Construction of Complex Structural Models
Th-04-06 Volume Based Modeling - Automated Construction of Complex Structural Models L. Souche* (Schlumberger), F. Lepage (Schlumberger) & G. Iskenova (Schlumberger) SUMMARY A new technology for creating,
More informationCrash-Starting the Simplex Method
Crash-Starting the Simplex Method Ivet Galabova Julian Hall School of Mathematics, University of Edinburgh Optimization Methods and Software December 2017 Ivet Galabova, Julian Hall Crash-Starting Simplex
More informationB553 Lecture 12: Global Optimization
B553 Lecture 12: Global Optimization Kris Hauser February 20, 2012 Most of the techniques we have examined in prior lectures only deal with local optimization, so that we can only guarantee convergence
More information3 INTEGER LINEAR PROGRAMMING
3 INTEGER LINEAR PROGRAMMING PROBLEM DEFINITION Integer linear programming problem (ILP) of the decision variables x 1,..,x n : (ILP) subject to minimize c x j j n j= 1 a ij x j x j 0 x j integer n j=
More informationPredicting Tumour Location by Modelling the Deformation of the Breast using Nonlinear Elasticity
Predicting Tumour Location by Modelling the Deformation of the Breast using Nonlinear Elasticity November 8th, 2006 Outline Motivation Motivation Motivation for Modelling Breast Deformation Mesh Generation
More informationEFFICIENT PRODUCTION OPTIMIZATION USING FLOW NETWORK MODELS. A Thesis PONGSATHORN LERLERTPAKDEE
EFFICIENT PRODUCTION OPTIMIZATION USING FLOW NETWORK MODELS A Thesis by PONGSATHORN LERLERTPAKDEE Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements
More informationSelected Topics in Column Generation
Selected Topics in Column Generation February 1, 2007 Choosing a solver for the Master Solve in the dual space(kelly s method) by applying a cutting plane algorithm In the bundle method(lemarechal), a
More informationComputational Complexity CSC Professor: Tom Altman. Capacitated Problem
Computational Complexity CSC 5802 Professor: Tom Altman Capacitated Problem Agenda: Definition Example Solution Techniques Implementation Capacitated VRP (CPRV) CVRP is a Vehicle Routing Problem (VRP)
More informationAM 221: Advanced Optimization Spring 2016
AM 221: Advanced Optimization Spring 2016 Prof. Yaron Singer Lecture 2 Wednesday, January 27th 1 Overview In our previous lecture we discussed several applications of optimization, introduced basic terminology,
More informationOPTIMIZATION FOR AUTOMATIC HISTORY MATCHING
INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING Volume 2, Supp, Pages 131 137 c 2005 Institute for Scientific Computing and Information OPTIMIZATION FOR AUTOMATIC HISTORY MATCHING Abstract. SHUGUANG
More informationLagrangian Relaxation: An overview
Discrete Math for Bioinformatics WS 11/12:, by A. Bockmayr/K. Reinert, 22. Januar 2013, 13:27 4001 Lagrangian Relaxation: An overview Sources for this lecture: D. Bertsimas and J. Tsitsiklis: Introduction
More informationMathematical Methods in Fluid Dynamics and Simulation of Giant Oil and Gas Reservoirs. 3-5 September 2012 Swissotel The Bosphorus, Istanbul, Turkey
Mathematical Methods in Fluid Dynamics and Simulation of Giant Oil and Gas Reservoirs 3-5 September 2012 Swissotel The Bosphorus, Istanbul, Turkey Fast and robust solvers for pressure systems on the GPU
More informationErosion modeling to improve asset life prediction
Erosion modeling to improve asset life prediction Erosion caused by solid particles in process flows impacting on the surfaces of downhole equipment or pipe walls is a common cause of damage and wear in
More informationPhD Student. Associate Professor, Co-Director, Center for Computational Earth and Environmental Science. Abdulrahman Manea.
Abdulrahman Manea PhD Student Hamdi Tchelepi Associate Professor, Co-Director, Center for Computational Earth and Environmental Science Energy Resources Engineering Department School of Earth Sciences
More informationOptimization. Using Analytic Solver Platform REVIEW BASED ON MANAGEMENT SCIENCE
Optimization Using Analytic Solver Platform REVIEW BASED ON MANAGEMENT SCIENCE What We ll Cover Today Introduction Frontline Systems Session Ι beta training program goals Overview of Analytic Solver Platform
More information6 Randomized rounding of semidefinite programs
6 Randomized rounding of semidefinite programs We now turn to a new tool which gives substantially improved performance guarantees for some problems We now show how nonlinear programming relaxations can
More informationSome Open Problems in Graph Theory and Computational Geometry
Some Open Problems in Graph Theory and Computational Geometry David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science ICS 269, January 25, 2002 Two Models of Algorithms Research
More information56:272 Integer Programming & Network Flows Final Exam -- December 16, 1997
56:272 Integer Programming & Network Flows Final Exam -- December 16, 1997 Answer #1 and any five of the remaining six problems! possible score 1. Multiple Choice 25 2. Traveling Salesman Problem 15 3.
More informationSolving lexicographic multiobjective MIPs with Branch-Cut-Price
Solving lexicographic multiobjective MIPs with Branch-Cut-Price Marta Eso (The Hotchkiss School) Laszlo Ladanyi (IBM T.J. Watson Research Center) David Jensen (IBM T.J. Watson Research Center) McMaster
More informationBilinear Programming
Bilinear Programming Artyom G. Nahapetyan Center for Applied Optimization Industrial and Systems Engineering Department University of Florida Gainesville, Florida 32611-6595 Email address: artyom@ufl.edu
More informationClosing the Loop via Scenario Modeling in a Time-Lapse Study of an EOR Target in Oman
Closing the Loop via Scenario Modeling in a Time-Lapse Study of an EOR Target in Oman Tania Mukherjee *(University of Houston), Kurang Mehta, Jorge Lopez (Shell International Exploration and Production
More informationSPEED-UP GEARBOX SIMULATIONS BY INTEGRATING SCORG. Dr. Christine Klier, Sahand Saheb-Jahromi, Ludwig Berger*
SPEED-UP GEARBOX SIMULATIONS BY INTEGRATING SCORG Dr. Christine Klier, Sahand Saheb-Jahromi, Ludwig Berger* CFD SCHUCK ENGINEERING Engineering Services in computational fluid Dynamics (CFD) 25 employees
More informationAdvanced Operations Research Techniques IE316. Quiz 2 Review. Dr. Ted Ralphs
Advanced Operations Research Techniques IE316 Quiz 2 Review Dr. Ted Ralphs IE316 Quiz 2 Review 1 Reading for The Quiz Material covered in detail in lecture Bertsimas 4.1-4.5, 4.8, 5.1-5.5, 6.1-6.3 Material
More informationNonlinear output constraints handling for production optimization of oil reservoirs
DOI.7/s596--953-3 ORIGINAL PAPER Nonlinear output constraints handling for production optimization of oil reservoirs Eka Suwartadi Stein Krogstad Bjarne Foss Received: 9 January / Accepted: 6 August Springer
More informationT6: Position-Based Simulation Methods in Computer Graphics. Jan Bender Miles Macklin Matthias Müller
T6: Position-Based Simulation Methods in Computer Graphics Jan Bender Miles Macklin Matthias Müller Jan Bender Organizer Professor at the Visual Computing Institute at Aachen University Research topics
More informationOPTIMIZATION METHODS
D. Nagesh Kumar Associate Professor Department of Civil Engineering, Indian Institute of Science, Bangalore - 50 0 Email : nagesh@civil.iisc.ernet.in URL: http://www.civil.iisc.ernet.in/~nagesh Brief Contents
More informationContents. Preface CHAPTER III
Optimization Edited by G.L. Nemhauser Georgia Institute of Technology A.H.G. Rinnooy Kan Erasmus University Rotterdam M.J. Todd Cornell Univerisity 1989 NORTH-HOLLAND AMSTERDAM NEW YORK OXFORD TOKYO Preface
More informationIMPROVING THE NUMERICAL ACCURACY OF HYDROTHERMAL RESERVOIR SIMULATIONS USING THE CIP SCHEME WITH THIRD-ORDER ACCURACY
PROCEEDINGS, Thirty-Seventh Workshop on Geothermal Reservoir Engineering Stanford University, Stanford, California, January 30 - February 1, 2012 SGP-TR-194 IMPROVING THE NUMERICAL ACCURACY OF HYDROTHERMAL
More informationIntegration of Geostatistical Modeling with History Matching: Global and Regional Perturbation
Integration of Geostatistical Modeling with History Matching: Global and Regional Perturbation Oliveira, Gonçalo Soares Soares, Amílcar Oliveira (CERENA/IST) Schiozer, Denis José (UNISIM/UNICAMP) Introduction
More informationNetwork Flows. 7. Multicommodity Flows Problems. Fall 2010 Instructor: Dr. Masoud Yaghini
In the name of God Network Flows 7. Multicommodity Flows Problems 7.2 Lagrangian Relaxation Approach Fall 2010 Instructor: Dr. Masoud Yaghini The multicommodity flow problem formulation: We associate nonnegative
More informationTELCOM2125: Network Science and Analysis
School of Information Sciences University of Pittsburgh TELCOM2125: Network Science and Analysis Konstantinos Pelechrinis Spring 2015 2 Part 4: Dividing Networks into Clusters The problem l Graph partitioning
More informationStochastic Separable Mixed-Integer Nonlinear Programming via Nonconvex Generalized Benders Decomposition
Stochastic Separable Mixed-Integer Nonlinear Programming via Nonconvex Generalized Benders Decomposition Xiang Li Process Systems Engineering Laboratory Department of Chemical Engineering Massachusetts
More informationMAR 572 Geophysical Simulation
MAR 572 Geophysical Simulation Wed/Fri 3:00-4:20 pm Endeavour 158 Prof. Marat Khairoutdinov Office hours: Endeavour 121; by email appt Email: marat.khairoutdinov@stonybrook.edu Class website: http://rossby.msrc.sunysb.edu/~marat/mar572.html
More informationOutline. Robust MPC and multiparametric convex programming. A. Bemporad C. Filippi. Motivation: Robust MPC. Multiparametric convex programming
Robust MPC and multiparametric convex programming A. Bemporad C. Filippi D. Muñoz de la Peña CC Meeting Siena /4 September 003 Outline Motivation: Robust MPC Multiparametric convex programming Kothares
More informationAn MILP Model for Short Term Scheduling. of a Special Class of Multipurpose Batch Plants
An MILP Model for hort Term cheduling of a pecial Class of Multipurpose Batch Plants ungdeuk Moon and Andrew N. Hrymak McMaster Advanced Control Consortium Department of Chemical Engineering, McMaster
More informationThe University of Jordan Department of Mathematics. Branch and Cut
The University of Jordan Department of Mathematics Heythem Marhoune Amina-Zahra Rezazgui Hanaa Kerim Sara Chabbi Branch and Cut Prepared and presented by : Sid Ahmed Benchiha Ibtissem Ben Kemache Lilia
More informationCS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension
CS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension Antoine Vigneron King Abdullah University of Science and Technology November 7, 2012 Antoine Vigneron (KAUST) CS 372 Lecture
More informationISE203 Optimization 1 Linear Models. Dr. Arslan Örnek Chapter 4 Solving LP problems: The Simplex Method SIMPLEX
ISE203 Optimization 1 Linear Models Dr. Arslan Örnek Chapter 4 Solving LP problems: The Simplex Method SIMPLEX Simplex method is an algebraic procedure However, its underlying concepts are geometric Understanding
More informationAbstract. 1 Introduction
Contact detection algorithm using Overhauser splines M. Ulbin, S. Ulaga and J. Masker University of Maribor, Faculty of Mechanical Engineering, Smetanova 77, 2000 Maribor, SLOVENIA E-mail: ulbin @ uni-mb.si
More informationA hybrid slurry CFD model: Euler-Euler to Euler-Lagrange
5th-6th December 2016 A hybrid slurry CFD model: Euler-Euler to Euler-Lagrange Alasdair Mackenzie Weir Advanced Research Centre, University of Strathclyde, Glasgow, Scotland Outline Background, context
More informationFrom final point cuts to!-polyhedral cuts
AUSSOIS 2017 From final point cuts to!-polyhedral cuts Egon Balas, Aleksandr M. Kazachkov, François Margot Tepper School of Business, Carnegie Mellon University Overview Background Generalized intersection
More informationCS 534: Computer Vision Segmentation and Perceptual Grouping
CS 534: Computer Vision Segmentation and Perceptual Grouping Ahmed Elgammal Dept of Computer Science CS 534 Segmentation - 1 Outlines Mid-level vision What is segmentation Perceptual Grouping Segmentation
More informationAdvanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture - 35 Quadratic Programming In this lecture, we continue our discussion on
More information