ROBUST OPTIMIZATION. Lecturer : Majid Rafiee

Size: px
Start display at page:

Download "ROBUST OPTIMIZATION. Lecturer : Majid Rafiee"

Transcription

1 ROBUST OPTIMIZATION

2 Uncertainty :

3 INTRODUCTION Very often, the realistic data are subect to uncertainty due to their random nature, measurement errors, or other reasons. Robust optimization belongs to an important methodology for dealing with optimization problems with data uncertainty. One maor motivation for studying robust optimization is that in many applications the data set is an appropriate notion of parameter uncertainty, e.g., for applications in which infeasibility cannot be accepted at all and for those cases that the parameter uncertainty is not stochastic, or if no distributional information is available.

4 ROBUST OPTIMIZATION a aˆ, a aˆ b a nominal values perturbation a a The random variables are distributed in the range [-1, 1] ξ ˆ ˆ a a, a a 1,1 a a ˆ a 1,1

5 ROBUST OPTIMIZATION min cx st.. x a x 0 b i i c a i b i x c c cˆ i i i 0 a a aˆ i i i i b b bˆ i i i 0i min cx st.. x a x i 0 b i

6 OPTIMIZATION STEPS ROBUST 1. In the first stage of this type of method, a deterministic data set is defined within the uncertain space. 2. in the second stage the best solution which is feasible for any realization of the data uncertainty in the given set is obtained. The corresponding second stage optimization problem is also called robust counterpart optimization problem.

7 Step 1 parameter uncertainty Assume that the left-hand side (LHS) constraint coefficients nominal values The random variables are distributed in the range [-1, 1] perturbation

8 Step 1 where U1, U2 are predefined uncertainty sets for (ξ11, ξ12) and (ξ21, ξ22), respectively. U1, U2???

9 Step 1 ξ 12 ξ 11, ξ 12 تعریف مجموعه ی U فرمول بندی کردن ξ a 11 a a a 12

10 History Robust optimization Soyster 1973 Ben-Tal, Nemirovski 1998 Bertsimas and Sim 2004

11 OPTIMIZATION STEPS ROBUST 1. In the first stage of this type of method, a deterministic data set is defined within the uncertain space. ξ 11, ξ 12,. 2. in the second stage the best solution which is feasible for any realization of the data uncertainty in the given set is obtained. The corresponding second stage optimization problem is also called robust counterpart optimization problem. U

12 Step 2 : Soyster 1973 Property If the set U is the box uncertainty set, then the corresponding robust counterpart constraint is equivalent to the following constraint

13 Step 2 : Ben-Tal, Nemirovski 1998 Property If the set U is the ellipsoidal uncertainty set, then the corresponding robust counterpart constraint is equivalent to the following constraint

14 Step 2 : Bertsimas and Sim 2004 Property If the set U is the box+polyhedral uncertainty set, then the corresponding robust counterpart constraint is equivalent to the following constraint

15 A VARIETY OF PARAMETERS UNCERTAINTY min cx st.. x a x i 0,1 b i c c cˆ i i i 0 min z st.. cx z x a x i 0,1 b i min cx st.. x a x i 0,1 b i a a aˆ i i i i b b bˆ i i i 0i min cx st.. x max ˆ a ˆ ix U i 0bi iaix b Ji 0,1 i

16 Conclusion Robust Linear Optimization

17 Conclusion Robust Mixed Integer Linear Optimization.

18 END

Robust Optimization in AIMMS

Robust Optimization in AIMMS Robust Optimization in AIMMS Peter Nieuwesteeg Senior AIMMS specialist Online webinar July 20, 2010 Paragon Decision Technology Inc 5400 Carillon Point, Kirkland, WA, USA E-mail: info@aimms.com Internet:

More information

Solving Two-stage Robust Optimization Problems by A Constraint-and-Column Generation Method

Solving Two-stage Robust Optimization Problems by A Constraint-and-Column Generation Method Solving Two-stage Robust Optimization Problems by A Constraint-and-Column Generation Method Bo Zeng Department of Industrial and Management Systems Engineering University of South Florida, Email: bzeng@usf.edu

More information

ENERGY EFFICIENT CONTROL OF VIRTUAL MACHINE CONSOLIDATION UNDER UNCERTAIN INPUT PARAMETERS FOR GREEN CLOUDS

ENERGY EFFICIENT CONTROL OF VIRTUAL MACHINE CONSOLIDATION UNDER UNCERTAIN INPUT PARAMETERS FOR GREEN CLOUDS ENERGY EFFICIENT CONTROL OF VIRTUAL MACHINE CONSOLIDATION UNDER UNCERTAIN INPUT PARAMETERS FOR GREEN CLOUDS ENERGY SAVING IN VIRTUALIZED DATACENTERS Assume small datacenter, 1064 Servers 10 72 28 LighWng

More information

AIMMS Language Reference - Robust Optimization

AIMMS Language Reference - Robust Optimization AIMMS Language Reference - Robust Optimization This file contains only one chapter of the book. For a free download of the complete book in pdf format, please visit www.aimms.com. Aimms 4 Copyright c 1993

More information

A robust optimization based approach to the general solution of mp-milp problems

A 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 information

Tilburg University. Document version: Publisher final version (usually the publisher pdf) Publication date: Link to publication

Tilburg University. Document version: Publisher final version (usually the publisher pdf) Publication date: Link to publication Tilburg University Multi-stage Adjustable Robust Mixed-Integer Optimization via Iterative Splitting of the Uncertainty set (Revision of CentER Discussion Paper 2014-056) Postek, Krzysztof; den Hertog,

More information

Improving Dual Bound for Stochastic MILP Models Using Sensitivity Analysis

Improving 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 information

Modeling and Managing Uncertainty in Process Planning and Scheduling

Modeling and Managing Uncertainty in Process Planning and Scheduling Modeling and Managing Uncertainty in Process Planning and Scheduling Marianthi Ierapetritou 1 and Zukui Li 2 1 Department of Chemical and Biochemical Engineering Rutgers University, Piscataway, NJ 08854

More information

Models and Heuristics for Robust Resource Allocation in Parallel and Distributed Computing Systems

Models and Heuristics for Robust Resource Allocation in Parallel and Distributed Computing Systems Models and Heuristics for Robust Resource Allocation in Parallel and Distributed Computing Systems D. Janovy, J. Smith, H. J. Siegel, and A. A. Maciejewski Colorado State University Outline n models and

More information

On Constraint Problems with Incomplete or Erroneous Data

On Constraint Problems with Incomplete or Erroneous Data On Constraint Problems with Incomplete or Erroneous Data Neil Yorke-Smith and Carmen Gervet IC Parc, Imperial College, London, SW7 2AZ, U.K. nys,cg6 @icparc.ic.ac.uk Abstract. Real-world constraint problems

More information

arxiv: v3 [math.oc] 24 Oct 2018

arxiv: v3 [math.oc] 24 Oct 2018 Article A Two-Stage Approach for Routing Multiple Unmanned Aerial Vehicles with Stochastic Fuel Consumption Saravanan Venkatachalam 1 * ID, Kaarthik Sundar ID, and Sivakumar Rathinam 1 Department of Industrial

More information

Linear & Conic Programming Reformulations of Two-Stage Robust Linear Programs

Linear & Conic Programming Reformulations of Two-Stage Robust Linear Programs 1 / 34 Linear & Conic Programming Reformulations of Two-Stage Robust Linear Programs Erick Delage CRC in decision making under uncertainty Department of Decision Sciences HEC Montreal (joint work with

More information

arxiv: v4 [math.oc] 4 Nov 2018

arxiv: v4 [math.oc] 4 Nov 2018 BCOL RESEARCH REPORT 17.02 Industrial Engineering & Operations Research University of California, Berkeley, CA 94720 1777 arxiv:1706.05795v4 [math.oc] 4 Nov 2018 SIMPLEX QP-BASED METHODS FOR MINIMIZING

More information

AIMMS Function Reference - GMPInstance Procedures and Functions

AIMMS Function Reference - GMPInstance Procedures and Functions AIMMS Function Reference - Instance Procedures and Functions This file contains only one chapter of the book. For a free download of the complete book in pdf format, please visit www.aimms.com Aimms 3.13

More information

The Robust Network Design Problem

The Robust Network Design Problem The Robust Network Design Problem Joint work with: N. Goyal (Microsoft India), N. Olver (Vrije Univ. Amsterdam) and C. Chekuri (UIUC), G. Oriolo (Rome), M.G. Scutella (Pisa) Alex Fréchette (UBC), Marina

More information

ME 555: Distributed Optimization

ME 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 information

Model Building in Operations Research MA4260 Instructor: Sun Defeng Office: S Phone:

Model Building in Operations Research MA4260 Instructor: Sun Defeng Office: S Phone: Model Building in Operations Research MA4260 Instructor: Sun Defeng Office: S14-04-25 Phone: 6874-3343 Email: matsundf@nus.edu.sg Objectives and scope. This course is intended to give a global view of

More information

Stochastic Network Interdiction / June 2001

Stochastic Network Interdiction / June 2001 Calhoun: The NPS Institutional Archive Faculty and Researcher Publications Faculty and Researcher Publications 2001-06 Stochastic Network Interdiction / June 2001 Wood, Kevin Monterey, California. Naval

More information

A set-based approach to robust control and verification of piecewise affine systems subject to safety specifications

A 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 information

A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed Integer Conic Quadratic Programs

A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed Integer Conic Quadratic Programs A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed Integer Conic Quadratic Programs Juan Pablo Vielma Shabbir Ahmed George L. Nemhauser H. Milton Stewart School of Industrial and Systems

More information

A novel method for identification of critical points in flow sheet synthesis under uncertainty

A novel method for identification of critical points in flow sheet synthesis under uncertainty Ian David Lockhart Bogle and Michael Fairweather (Editors), Proceedings of the nd European Symposium on Computer Aided Process Engineering, 17-0 June 01, London. 01 Elsevier B.V. All rights reserved A

More information

Introduction to Mathematical Programming IE406. Lecture 20. Dr. Ted Ralphs

Introduction 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 information

Robust real-time optimization for the linear oil blending

Robust real-time optimization for the linear oil blending Robust real-time optimization for the linear oil blending Stefan Janaqi, Jorge Aguilera, Mèriam Chèbre To cite this version: Stefan Janaqi, Jorge Aguilera, Mèriam Chèbre. Robust real-time optimization

More information

A Robust Approach to the Capacitated Vehicle Routing Problem with Uncertain Costs

A Robust Approach to the Capacitated Vehicle Routing Problem with Uncertain Costs A Robust Approach to the Capacitated Vehicle Routing Problem with Uncertain Costs Lars Eufinger Deutsche Bahn AG, Poststraße 0, 6039 Frankfurt a. Main, Germany, lars.eufinger@deutschebahn.com Jannis Kurtz

More information

Lagrangian Relaxation as a solution approach to solving the Survivable Multi-Hour Network Design Problem

Lagrangian Relaxation as a solution approach to solving the Survivable Multi-Hour Network Design Problem Lagrangian Relaxation as a solution approach to solving the Survivable Multi-Hour Network Design Problem S.E. Terblanche, R. Wessäly and J.M. Hattingh School of Computer, Statistical and Mathematical Sciences

More information

Stochastic gradient methods for the optimization of water supply systems

Stochastic gradient methods for the optimization of water supply systems European Water 58: 415-421, 2017. 2017 E.W. Publications Stochastic gradient methods for the optimization of water supply systems A.A. Gaivoronski 1, J. Napolitano 2* and G.M. Sechi 3 1 Department of Industrial

More information

Algorithms for two-stage stochastic linear programmming

Algorithms for two-stage stochastic linear programmming Algorithms for two-stage stochastic linear programmming Basic Course on Stochastic Programming, IMPA 2016 Description Consider the following two-stage stochastic linear program c x + N min x s.t. Ax =

More information

Principles and Practical Applications of the Optimal Values Management and Programming

Principles and Practical Applications of the Optimal Values Management and Programming Principles and Practical Applications of the Optimal Values Management and Programming Nderim Zeqiri State University of Tetova, Faculty of Applied Sciences, Tetovo, Macedonia Received May 05, 2016; Accepted

More information

Simultaneous Perturbation Stochastic Approximation Algorithm Combined with Neural Network and Fuzzy Simulation

Simultaneous Perturbation Stochastic Approximation Algorithm Combined with Neural Network and Fuzzy Simulation .--- Simultaneous Perturbation Stochastic Approximation Algorithm Combined with Neural Networ and Fuzzy Simulation Abstract - - - - Keywords: Many optimization problems contain fuzzy information. Possibility

More information

Linear Programming. Course review MS-E2140. v. 1.1

Linear Programming. Course review MS-E2140. v. 1.1 Linear Programming MS-E2140 Course review v. 1.1 Course structure Modeling techniques Linear programming theory and the Simplex method Duality theory Dual Simplex algorithm and sensitivity analysis Integer

More information

Using AIMMS for Monte Carlo Simulation

Using AIMMS for Monte Carlo Simulation Using AIMMS for Monte Carlo Simulation Product Training Webinar Deanne Zhang November 16, 2016 Agenda > Introduction > Steps to do Monte Carlo simulation in AIMMS > A demo of running multiple simulations

More information

On The Recoverable Robust Traveling Salesman Problem

On The Recoverable Robust Traveling Salesman Problem Noname manuscript No. (will be inserted by the editor) On The Recoverable Robust Traveling Salesman Problem André Chassein Marc Goerigk Received: date / Accepted: date Abstract We consider an uncertain

More information

Efficient implementation of Constrained Min-Max Model Predictive Control with Bounded Uncertainties

Efficient implementation of Constrained Min-Max Model Predictive Control with Bounded Uncertainties Efficient implementation of Constrained Min-Max Model Predictive Control with Bounded Uncertainties D.R. Ramírez 1, T. Álamo and E.F. Camacho2 Departamento de Ingeniería de Sistemas y Automática, Universidad

More information

Uncertainties: Representation and Propagation & Line Extraction from Range data

Uncertainties: Representation and Propagation & Line Extraction from Range data 41 Uncertainties: Representation and Propagation & Line Extraction from Range data 42 Uncertainty Representation Section 4.1.3 of the book Sensing in the real world is always uncertain How can uncertainty

More information

CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM

CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM 20 CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM 2.1 CLASSIFICATION OF CONVENTIONAL TECHNIQUES Classical optimization methods can be classified into two distinct groups:

More information

Robust Multi-UAV Planning in Dynamic and Uncertain Environments. Chung Tin

Robust Multi-UAV Planning in Dynamic and Uncertain Environments. Chung Tin Robust Multi-UAV Planning in Dynamic and Uncertain Environments by Chung Tin B.Eng. in Mechanical Engineering The University of Hong Kong, 22 Submitted to the Department of Mechanical Engineering in partial

More information

Manuskripte aus den. Institut für Betriebswirtschaftslehre, der Universität Kiel

Manuskripte aus den. Institut für Betriebswirtschaftslehre, der Universität Kiel Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel No. 606 Robustness in Combinatorial Optimization and Scheduling Theory: An Extended Annotated Bibliography 1 Yury Nikulin

More information

Exponential Membership Functions in Fuzzy Goal Programming: A Computational Application to a Production Problem in the Textile Industry

Exponential Membership Functions in Fuzzy Goal Programming: A Computational Application to a Production Problem in the Textile Industry American Journal of Computational and Applied Mathematics 2015, 5(1): 1-6 DOI: 10.5923/j.ajcam.20150501.01 Exponential Membership Functions in Fuzzy Goal Programming: A Computational Application to a Production

More information

Multidisciplinary Analysis and Optimization

Multidisciplinary Analysis and Optimization OptiY Multidisciplinary Analysis and Optimization Process Integration OptiY is an open and multidisciplinary design environment, which provides direct and generic interfaces to many CAD/CAE-systems and

More information

LP Graphic Solution & Solver for LP

LP Graphic Solution & Solver for LP LP Graphic Solution & Excel@ Solver for LP 5X + 3Y = 0 (3) Draw the objective function line on the graph: Any (including the optimal) LP solution has to be part of

More information

MULTI-OBJECTIVE PROGRAMMING FOR TRANSPORTATION PLANNING DECISION

MULTI-OBJECTIVE PROGRAMMING FOR TRANSPORTATION PLANNING DECISION MULTI-OBJECTIVE PROGRAMMING FOR TRANSPORTATION PLANNING DECISION Piyush Kumar Gupta, Ashish Kumar Khandelwal, Jogendra Jangre Mr. Piyush Kumar Gupta,Department of Mechanical, College-CEC/CSVTU University,Chhattisgarh,

More information

An Extension of the Multicut L-Shaped Method. INEN Large-Scale Stochastic Optimization Semester project. Svyatoslav Trukhanov

An Extension of the Multicut L-Shaped Method. INEN Large-Scale Stochastic Optimization Semester project. Svyatoslav Trukhanov An Extension of the Multicut L-Shaped Method INEN 698 - Large-Scale Stochastic Optimization Semester project Svyatoslav Trukhanov December 13, 2005 1 Contents 1 Introduction and Literature Review 3 2 Formal

More information

Nonconvex Robust Optimization for Problems with Constraints Dimitris Bertsimas, Omid Nohadani, and Kwong Meng Teo

Nonconvex Robust Optimization for Problems with Constraints Dimitris Bertsimas, Omid Nohadani, and Kwong Meng Teo Nonconvex Robust Optimization for Problems with Constraints Dimitris Bertsimas, Omid Nohadani, and Kwong Meng Teo Operations Research Center and Sloan School of Management, Massachusetts Institute of Technology,

More information

Algebra Reviews & LP Graphic Solutions

Algebra Reviews & LP Graphic Solutions Algebra Reviews & LP Graphic Solutions Given Constraints to Draw Straight Lines and Identify Feasible Region Draw Straight Lines for Each Constraint: From Equ(1), Set X = 0, Y = 3, a(0, 3); Set Y = 0,

More information

Linear Programming in Small Dimensions

Linear Programming in Small Dimensions Linear Programming in Small Dimensions Lekcija 7 sergio.cabello@fmf.uni-lj.si FMF Univerza v Ljubljani Edited from slides by Antoine Vigneron Outline linear programming, motivation and definition one dimensional

More information

Binary decision diagrams for computing the non-dominated set

Binary decision diagrams for computing the non-dominated set Binary decision diagrams for computing the non-dominated set July 13, 2015 Antti Toppila and Ahti Salo 27th European Conference on Operational Research, 12-15 July 2015, University of Strathclyde, Glasgow,

More information

Interference Alignment Approaches

Interference Alignment Approaches Network Coding for Three Unicast Sessions: Interference Alignment Approaches Abinesh Ramakrishnan*, Abhik Das, Hamed Maleki*, Athina Markopoulou*, Syed Jafar*, Sriram Vishwanath (*) UC Irvine and ( ) UT

More information

A New Bound for the Midpoint Solution in Minmax Regret Optimization with an Application to the Robust Shortest Path Problem

A New Bound for the Midpoint Solution in Minmax Regret Optimization with an Application to the Robust Shortest Path Problem A New Bound for the Midpoint Solution in Minmax Regret Optimization with an Application to the Robust Shortest Path Problem André Chassein and Marc Goerigk Fachbereich Mathematik, Technische Universität

More information

Certainty Closure. A Framework for Reliable Constraint Reasoning with Uncertainty. Neil Yorke-Smith and Carmen Gervet

Certainty Closure. A Framework for Reliable Constraint Reasoning with Uncertainty. Neil Yorke-Smith and Carmen Gervet Certainty Closure A Framework for Reliable Constraint Reasoning with Uncertainty Neil Yorke-Smith and Carmen Gervet IC Parc, Imperial College London, SW7 2AZ, U.K. nys,cg6 @icparc.ic.ac.uk Abstract Constraint

More information

Robust Nonconvex Optimization for Simulation-based Problems

Robust Nonconvex Optimization for Simulation-based Problems Robust Nonconve Optimization for Simulation-based Problems Dimitris Bertsimas Sloan School of Management and Operations Research Center, Massachusetts Institute of Technology, E40-147, Cambridge, Massachusetts

More information

February 19, Integer programming. Outline. Problem formulation. Branch-andbound

February 19, Integer programming. Outline. Problem formulation. Branch-andbound Olga Galinina olga.galinina@tut.fi ELT-53656 Network Analysis and Dimensioning II Department of Electronics and Communications Engineering Tampere University of Technology, Tampere, Finland February 19,

More information

Unconstrained Robust Optimization using a Descent-based Crossover Operator

Unconstrained Robust Optimization using a Descent-based Crossover Operator Unconstrained Robust Optimization using a Descent-based Crossover Operator Aleksi Porokka 2, Ankur Sinha, Pekka Malo 2, and Kalyanmoy Deb 3 Productivity and Quantitative Methods Indian Institute of Management

More information

Simulation: Solving Dynamic Models ABE 5646 Week 12, Spring 2009

Simulation: Solving Dynamic Models ABE 5646 Week 12, Spring 2009 Simulation: Solving Dynamic Models ABE 5646 Week 12, Spring 2009 Week Description Reading Material 12 Mar 23- Mar 27 Uncertainty and Sensitivity Analysis Two forms of crop models Random sampling for stochastic

More information

ROPI. A Robust Optimization Programming Interface Version 0.1.0

ROPI. A Robust Optimization Programming Interface Version 0.1.0 ROPI A Robust Optimization Programming Interface Version 0.1.0 Written by Marc Goerigk Institute for Numerical and Applied Mathematics University of Göttingen, Germany m.goerigk@math.uni-goettingen.de

More information

A Distributed Algorithm for Random Convex Programming

A Distributed Algorithm for Random Convex Programming A Distributed Algorithm for Random Convex Programming Luca Carlone, Vaibhav Srivastava, Francesco Bullo, and Giuseppe C. Calafiore Abstract We study a distributed approach for solving random convex programs

More information

Resilient Networks. 3.1 Resilient Network Design - Intro. Mathias Fischer

Resilient Networks. 3.1 Resilient Network Design - Intro. Mathias Fischer Mathias Fischer Resilient Networks. Resilient Network Design - Intro Prepared along: Michal Pioro and Deepankar Medhi - Routing, Flow, and Capacity Design in Communication and Computer Networks, The Morgan

More information

Generating Hard Instances for Robust Combinatorial Optimization

Generating Hard Instances for Robust Combinatorial Optimization Generating Hard Instances for Robust Combinatorial Optimization Marc Goerigk 1 and Stephen J. Maher 2 1 Network and Data Science Management, University of Siegen, Germany 2 Department of Management Science,

More information

Robust Optimization for Unconstrained Simulation-Based Problems

Robust Optimization for Unconstrained Simulation-Based Problems OPERATIONS RESEARCH Vol. 58, No. 1, January February 21, pp. 161 178 issn 3-364X eissn 1526-5463 1 581 161 informs doi 1.1287/opre.19.715 21 INFORMS Robust Optimization for Unconstrained Simulation-Based

More information

ROBUST 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 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 information

4.1 The original problem and the optimal tableau

4.1 The original problem and the optimal tableau Chapter 4 Sensitivity analysis The sensitivity analysis is performed after a given linear problem has been solved, with the aim of studying how changes to the problem affect the optimal solution In particular,

More information

Transfer function approach based on simulation results for the determination of POD curves

Transfer function approach based on simulation results for the determination of POD curves Transfer function approach based on simulation results for the determination of POD curves Séverine Demeyer Frédéric Jenson Ekaterina Iakovleva Nicolas Dominguez 2 CEA, LIST, France 2 EADS, IW, France

More information

Robust Solutions for the DWDM Routing and Provisioning Problem: Models and Algorithms

Robust Solutions for the DWDM Routing and Provisioning Problem: Models and Algorithms Technical Report 01-EMIS-03 Robust Solutions for the DWDM Routing and Provisioning Problem: Models and Algorithms by J. Kennington, 1 K. Lewis, 2 E. Olinick, 1 A. Ortynski 3 and G. Spiride 4 1 {jlk,olinick}@engr.smu.edu

More information

Varianzbasierte Robustheitsoptimierung

Varianzbasierte Robustheitsoptimierung DVM Workshop Zuverlässigkeit und Probabilistik München, November 2017 Varianzbasierte Robustheitsoptimierung unter Pareto Kriterien Veit Bayer Thomas Most Dynardo GmbH Weimar Robustness Evaluation 2 How

More information

Multiobjective engineering design optimization problems: a sensitivity analysis approach

Multiobjective engineering design optimization problems: a sensitivity analysis approach Universidade de São Paulo Biblioteca Digital da Produção Intelectual - BDPI Departamento de Naval e Oceânica - EP/PNV Artigos e Materiais de Revistas Científicas - EP/PNV 2012 Multiobjective engineering

More information

2 Dept. of Computer Applications 3 Associate Professor Dept. of Computer Applications

2 Dept. of Computer Applications 3 Associate Professor Dept. of Computer Applications International Journal of Computing Science and Information Technology, 2014, Vol.2(2), 15-19 ISSN: 2278-9669, April 2014 (http://ijcsit.org) Optimization of trapezoidal balanced Transportation problem

More information

Transactions on the Built Environment vol 28, 1997 WIT Press, ISSN

Transactions on the Built Environment vol 28, 1997 WIT Press,   ISSN Shape/size optimization of truss structures using non-probabilistic description of uncertainty Eugenio Barbieri, Carlo Cinquini & Marco Lombard! LWveraz'ry of fawa, DeparfmcMf q/#r%cf%ra7 Mzc/zamcj, fawa,

More information

Exact Solution of the Robust Knapsack Problem

Exact Solution of the Robust Knapsack Problem Exact Solution of the Robust Knapsack Problem Michele Monaci 1 and Ulrich Pferschy 2 and Paolo Serafini 3 1 DEI, University of Padova, Via Gradenigo 6/A, I-35131 Padova, Italy. monaci@dei.unipd.it 2 Department

More information

Robustness analysis of metal forming simulation state of the art in practice. Lectures. S. Wolff

Robustness analysis of metal forming simulation state of the art in practice. Lectures. S. Wolff Lectures Robustness analysis of metal forming simulation state of the art in practice S. Wolff presented at the ICAFT-SFU 2015 Source: www.dynardo.de/en/library Robustness analysis of metal forming simulation

More information

Random Keys Genetic Algorithm with Adaptive Penalty Function for Optimization of Constrained Facility Layout Problems

Random Keys Genetic Algorithm with Adaptive Penalty Function for Optimization of Constrained Facility Layout Problems Random Keys Genetic Algorithm with Adaptive Penalty Function for Optimization of Constrained Facility Layout Problems Bryan A. Norman and Alice E. Smith Department of Industrial Engineering University

More information

Convex Optimization. August 26, 2008

Convex Optimization. August 26, 2008 Convex Optimization Instructor: Angelia Nedich August 26, 2008 Outline Lecture 1 What is the Course About Who Cares and Why Course Objective Convex Optimization History New Interest in the Topic Formal

More information

Integration of Design and Control under Uncertainty: A New Back-off Approach using PSE Approximations

Integration of Design and Control under Uncertainty: A New Back-off Approach using PSE Approximations Integration of Design and Control under Uncertainty: A New Back-off Approach using PSE Approximations by Siddharth Mehta A thesis presented to the University of Waterloo in fulfillment of the thesis requirement

More information

Introduction to Stochastic Combinatorial Optimization

Introduction to Stochastic Combinatorial Optimization Introduction to Stochastic Combinatorial Optimization Stefanie Kosuch PostDok at TCSLab www.kosuch.eu/stefanie/ Guest Lecture at the CUGS PhD course Heuristic Algorithms for Combinatorial Optimization

More information

The SYMPHONY Callable Library for Mixed-Integer Linear Programming

The SYMPHONY Callable Library for Mixed-Integer Linear Programming The SYMPHONY Callable Library for Mixed-Integer Linear Programming Menal Guzelsoy and Ted Ralphs Industrial and Systems Engineering Lehigh University INFORMS Annual Meeting, San Francisco, CA, November

More information

The SYMPHONY Callable Library for Mixed-Integer Linear Programming

The SYMPHONY Callable Library for Mixed-Integer Linear Programming The SYMPHONY Callable Library for Mixed-Integer Linear Programming Ted Ralphs and Menal Guzelsoy Industrial and Systems Engineering Lehigh University INFORMS Computing Society Conference, Annapolis, MD,

More information

Reliability-Based Optimization Using Evolutionary Algorithms

Reliability-Based Optimization Using Evolutionary Algorithms Reliability-Based Optimization Using Evolutionary Algorithms The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published

More information

Exact Solution of the Robust Knapsack Problem

Exact Solution of the Robust Knapsack Problem 1 Exact Solution of the Robust Knapsack Problem Michele Monaci 1 and Ulrich Pferschy 2 and Paolo Serafini 3 1 DEI, University of Padova, Via Gradenigo 6/A, I-35131 Padova, Italy. monaci@dei.unipd.it 2

More information

A Two-Stage Stochastic Programming Approach for Location-Allocation Models in Uncertain Environments

A Two-Stage Stochastic Programming Approach for Location-Allocation Models in Uncertain Environments A Two-Stage Stochastic Programming Approach for Location-Allocation in Uncertain Environments Markus Kaiser, Kathrin Klamroth Optimization & Approximation Department of Mathematics University of Wuppertal

More information

Robust time-varying shortest path with arbitrary waiting time at vertices

Robust time-varying shortest path with arbitrary waiting time at vertices Croatian Operational Research Review 525 CRORR 8(2017), 525 56 Robust time-varying shortest path with arbitrary waiting time at vertices Gholamhassan Shirdel 1, and Hassan Rezapour 1 1 Department of Mathematics,

More information

Finding Euclidean Distance to a Convex Cone Generated by a Large Number of Discrete Points

Finding Euclidean Distance to a Convex Cone Generated by a Large Number of Discrete Points Submitted to Operations Research manuscript (Please, provide the manuscript number!) Finding Euclidean Distance to a Convex Cone Generated by a Large Number of Discrete Points Ali Fattahi Anderson School

More information

Chapter I INTRODUCTION. and potential, previous deployments and engineering issues that concern them, and the security

Chapter I INTRODUCTION. and potential, previous deployments and engineering issues that concern them, and the security Chapter I INTRODUCTION This thesis provides an introduction to wireless sensor network [47-51], their history and potential, previous deployments and engineering issues that concern them, and the security

More information

Adaptive Large Neighborhood Search

Adaptive Large Neighborhood Search Adaptive Large Neighborhood Search Heuristic algorithms Giovanni Righini University of Milan Department of Computer Science (Crema) VLSN and LNS By Very Large Scale Neighborhood (VLSN) local search, we

More information

Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments

Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments Jacob Focke 1, Nicole Megow 2, and Julie Meißner 3 1 Department of Computer Science, University of Oxford, Oxford, UK jacob.focke@cs.ox.ac.uk

More information

Optimization Under Uncertainty

Optimization Under Uncertainty Optimization Under Uncertainty Vineet Goyal Submitted in partial fulfillment of the requirements of the degree of Doctor of Philosophy in Algorithms, Combinatorics and Optimization August 2008 Tepper School

More information

Computers & Industrial Engineering

Computers & Industrial Engineering Computers & Industrial Engineering 59 (2010) 387 397 Contents lists available at ScienceDirect Computers & Industrial Engineering journal homepage: www.elsevier.com/locate/caie A robust optimization approach

More information

13. Cones and semidefinite constraints

13. Cones and semidefinite constraints CS/ECE/ISyE 524 Introduction to Optimization Spring 2017 18 13. Cones and semidefinite constraints ˆ Geometry of cones ˆ Second order cone programs ˆ Example: robust linear program ˆ Semidefinite constraints

More information

OPTIMAL DESIGN OF WATER DISTRIBUTION NETWORKS UNDER A SPECIFIC LEVEL OF RELIABILITY

OPTIMAL DESIGN OF WATER DISTRIBUTION NETWORKS UNDER A SPECIFIC LEVEL OF RELIABILITY Ninth International Water Technology Conference, IWTC9 2005, Sharm El-Sheikh, Egypt 641 OPTIMAL DESIGN OF WATER DISTRIBUTION NETWORKS UNDER A SPECIFIC LEVEL OF RELIABILITY HOSSAM A.A. ABDEL-GAWAD Irrigation

More information

A PRIMAL-DUAL EXTERIOR POINT ALGORITHM FOR LINEAR PROGRAMMING PROBLEMS

A PRIMAL-DUAL EXTERIOR POINT ALGORITHM FOR LINEAR PROGRAMMING PROBLEMS Yugoslav Journal of Operations Research Vol 19 (2009), Number 1, 123-132 DOI:10.2298/YUJOR0901123S A PRIMAL-DUAL EXTERIOR POINT ALGORITHM FOR LINEAR PROGRAMMING PROBLEMS Nikolaos SAMARAS Angelo SIFELARAS

More information

DM545 Linear and Integer Programming. Lecture 2. The Simplex Method. Marco Chiarandini

DM545 Linear and Integer Programming. Lecture 2. The Simplex Method. Marco Chiarandini DM545 Linear and Integer Programming Lecture 2 The Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 3. 4. Standard Form Basic Feasible Solutions

More information

Estimation of Unknown Parameters in Dynamic Models Using the Method of Simulated Moments (MSM)

Estimation of Unknown Parameters in Dynamic Models Using the Method of Simulated Moments (MSM) Estimation of Unknown Parameters in ynamic Models Using the Method of Simulated Moments (MSM) Abstract: We introduce the Method of Simulated Moments (MSM) for estimating unknown parameters in dynamic models.

More information

Stochastic User Equilibrium with Equilibrated Choice Sets: Solving the Restricted SUE with Threshold and largescale

Stochastic User Equilibrium with Equilibrated Choice Sets: Solving the Restricted SUE with Threshold and largescale Stochastic User Equilibrium with Equilibrated Choice Sets: Solving the Restricted SUE with Threshold and largescale application Thomas Kjær Rasmussen, David Paul Watling, Carlo Giacomo Watling & Otto Anker

More information

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.685 Electric Machines Class Notes 11: Design Synthesis and Optimization February 11, 2004 c 2003 James

More information

Flexible Design Methodology

Flexible Design Methodology Manufacturing Conference Design Engineering Technical Conferences, 3:39 48. Baltimore, Maryland, SA: ASME, 2000. Flexible Design Methodology Christoph Roser Department of Mech. & Ind. Engineering niversity

More information

6.854 Advanced Algorithms. Scribes: Jay Kumar Sundararajan. Duality

6.854 Advanced Algorithms. Scribes: Jay Kumar Sundararajan. Duality 6.854 Advanced Algorithms Scribes: Jay Kumar Sundararajan Lecturer: David Karger Duality This lecture covers weak and strong duality, and also explains the rules for finding the dual of a linear program,

More information

Robust chirped mirrors

Robust chirped mirrors Robust chirped mirrors Omid Nohadani, 1, * Jonathan R. Birge, 2 Franz X. Kärtner, 2 and Dimitris J. Bertsimas 1 1 Operations Research Center and Sloan School of Management, Massachusetts Institute of Technology,

More information

Bipolar Fuzzy Line Graph of a Bipolar Fuzzy Hypergraph

Bipolar Fuzzy Line Graph of a Bipolar Fuzzy Hypergraph BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 13, No 1 Sofia 2013 Print ISSN: 1311-9702; Online ISSN: 1314-4081 DOI: 10.2478/cait-2013-0002 Bipolar Fuzzy Line Graph of a

More information

Optimization of Taxiway Traversal at Congested Airports

Optimization of Taxiway Traversal at Congested Airports Optimization of Taxiway Traversal at Congested Airports Ross Anderson, Dejan Milutinović UC Santa Cruz, Santa Cruz, CA, USA Airport runways and taxiways have been identified as a key source of system-wide

More information

An Efficient and Robust Computational Framework for Studying Lifetime and Information Capacity in Sensor Networks

An Efficient and Robust Computational Framework for Studying Lifetime and Information Capacity in Sensor Networks An Efficient and Robust Computational Framework for Studying Lifetime and Information Capacity in Sensor Networks Enrique J. Duarte-Melo, Mingyan Liu and Archan Misra January 15, 2004 Abstract In this

More information

Discrete Covering. Location. Problems. Louis. Luangkesorn. Housekeeping. Dijkstra s Shortest Path. Discrete. Covering. Models.

Discrete Covering. Location. Problems. Louis. Luangkesorn. Housekeeping. Dijkstra s Shortest Path. Discrete. Covering. Models. Network Design Network Design Network Design Network Design Office Hours Wednesday IE 079/079 Logistics and Supply Chain Office is closed Wednesday for building renovation work. I will be on campus (or

More information

Algorithm to Solve a Chance-Constrained Network Capacity Design Problem with Stochastic Demands with Finite Support

Algorithm to Solve a Chance-Constrained Network Capacity Design Problem with Stochastic Demands with Finite Support Algorithm to Solve a Chance-Constrained Network Capacity Design Problem with Stochastic Demands with Finite Support Kathryn M. Schumacher, Richard Li-Yang Chen, Amy E.M. Cohn March 19, 2014 Abstract We

More information

The Branch-and-Sandwich Algorithm for Mixed-Integer Nonlinear Bilevel Problems

The Branch-and-Sandwich Algorithm for Mixed-Integer Nonlinear Bilevel Problems The Branch-and-Sandwich Algorithm for Mixed-Integer Nonlinear Bilevel Problems Polyxeni-M. Kleniati and Claire S. Adjiman MINLP Workshop June 2, 204, CMU Funding Bodies EPSRC & LEVERHULME TRUST OUTLINE

More information