Optimization Problems with Linear Chance Constraints Structure, Numerics and Applications. R. Henrion
|
|
- Carol Wilkins
- 6 years ago
- Views:
Transcription
1 Optimization Problems with Linear Chance Constraints Structure, Numerics and Applications R. Henrion Weierstraß-Institut Berlin Introduction with Examples Structure (convexity, differentiability, existence of solutions) Numerics (singular normal distributions) 75. Sitzung der GOR Arbeitsgruppe Praxis der Mathematischen Optimierung Optimization under Uncertainty Bad Honnef, October 20-21, 2005
2 Chance Constraints system of stochastic inequalities g x, 0 random parameter (meteorological data, product demands, prices, return rate) 'here-and-now'- decisions: x deterministic reformulations: a) expected-value constraint: Egx, 0 or g x, E 0 b) worst-case constraint: g x, 0 c) chance-constraint: P g x, 0 p p0,1
3 Portfolio-Optimization (1) Distribute capital K among n assets with random return. simplest model: maximize expected return! x i capital put on asset i, i return rate for asset i random vector, assumption: N, normally distributed linear optimization problem: Example: 1.2,1.3, n max,x i1 x i K, x i 0 Distribution of Return probability of loss: 33.4% expected value
4 random return:, x Portfolio-Optimization (2) probability of surplus: optimization problem with chance constraints: max,x i1 n x i K, x i 0, P,x K p P, xk p0,1 expected return p=0.9 p=0.8 p=0.7 probability of surplus
5 A Problem from Chemical Engineering R.H., P. Li, A. Möller, M. Wendt, G. Wozny (Comp.&Math. Appl. 2003) Distillation (Methanole-Water) Modeled by large DAE-System continuous (stochastic) inflow level constraints (as chance constraints)
6 Optimal Control feed rate F heating Q reflux R p = 0.90/ selected state variables in 20 trays of column
7 Simulated Inflow Profiles Application of optimal feed rate to 100 simulated inflow profiles (Gaussian Process) p = 0.99 optimal feed rate supposing the expected inflow profile Optimal value (OV) of the objective versus safety level (p) OV p
8 Stochastic Reservoir Constraints 1,..., n x x 1,..., x n l 0 F discretized stochastic inflow to reservoir discretized control of feed extraction from reservoir initial filling level of reservoir upper filling level allowed for reservoir Stochastic reservoir constraints: i l 0 j x j j1 j1 fillinglevelattimei i F i1,...,n Chance Constraints: P L x p regular, triangular
9 Capacity Expansion in Stochastic Networks Graph with stochastic load in the nodes and with capacities x in the arcs 1 x 1 1 x 1 2 x 2 x x x 3 Chance Constraint Model: P Ax p A not surjective! number of inequalities larger than dimension of random vector
10 3 Basic Types of Chance Constraints (CC) CC with stochastic coefficient matrix: P xa p (e.g., portfolio optimization, mixture problems) CC with separated randomness: P Ax p a) regular case: A surjective (e.g., stochastic reservoir-constraints) b) singular case: A not surjective occurs when number of inequalities exceeds dimension of random vector (e.g., networks with stochastic demand, robotics: collision avoidance with random obstacles)
11 Structural Properties of CCs with Stochastic Coefficient Matrix R.H. (SPEPS 2005) Theorem: (Van de Panne/Popp, Kataoka, 1963) Let N,, positive definite. Then, M: x n Px, p is convex for p0.5. Extended Model: M p : x n Pqx, p
12 An extended convexity result M p : x n Pqx, p Theorem: Let have an ellipticallysymmetric distribution with density and parameters, positive definite.. Under each! of the following assumptions: 1. q is affinelinear or 2. q i 0, convex, i 0, i,j 0 it holds that M p is convex for alle and all p0.5.
13 Exact domains of convexity, nontriviality and compactness M p : x n Pqx, p, N,, positive definite : 10.5 Theorem: Let q be affine linear a n d regular. Then, domain of convexity domain of nontriviality p p domain of compactness
14 Existence of Solutions to Problems with Stochastic Coefficient Matrix Optimization problem: P min f xp q xa p p0,1 Theorem: f lower semicontinuous i N i, i, i rows of, i positive definite a 0 q homeomorphism e.g., q xx P has a solution for p min i i 1 i 1
15 Singular Normal Distributions and Quasiconcave Measures CC with separated randomness: P Ax p P Ax p F x p with : A distribution function of Special case: normal distribution: N, N A, A A T regular regular case: A surjective A A T regular singular case: A not surjective A A T singular F is a singular normal distribution
16 Lipschitz continuity of quasiconcave Measures R.H., W. Römisch (Ann. Oper. Res. 2005) Theorem: Let have a quasiconcave distribution (e.g., regular or singular normal, uniform, Pareto, Dirchlet, lognormal, Gamma etc.). Then, the distribution function of is (Lipschitz) continuous iff Var i 0 i. Example: Singular normal distribution with covariance matrix of rank 1 C C
17 Reduction of singular normal distribution functions to regular ones J. Bukszar, R.H., M. Hujter, T. Szantai (SPEPS 2004) N,, AA T, M xuaux, I u,xi a i, ux i singular Cholesky-decomposition induced polyhedron active index set at u I M x I u M x: I u,xi family of all active index sets x is called nondegenerate, if rank a i ii I I I M x Theorem: If x nondegenerate F x 1 I I M x 1 I F I x I I N I, A I A I T regular singular normal distribution sum of regular normal distributions
18 If F I Gradient Formula and Algorithm x nondegenerate F x 1 I I M x 1 I F I x I smooth regular normal distribution function x nondegenerate I M x locally constant Corollary: If x nondegenerate F x I I M x 1 I1 F I x I Algorithm: 1. Determine all corners of M x Fukuda, Scdd 2. Compute I Mx as family of subsets of corner index sets 3. Calculate the F by formula from regular normal distributions F I Genz, Szantai 4. Calculate gradients by reduction t o functional values
19 Numerical Tests Dim: 5 x 10 Prob.: Error: Poly: 1.00 Szantai: Deak: MC: Genz: Dim: 5 x 15 Prob.: Error: Poly: 1.00 Deak: Szantai: MC: Genz: Dim: 5 x 20 Prob.: Error: Poly: 1.00 Deak: Szantai: MC: Genz: Dim: 5 x 25 Prob.: Error: Poly: 1.00 Szantai: Deak: MC: Genz: Dim: 10 x 20 Prob.: Error: Poly: 1.00 Szantai: Deak: MC: Genz: Dim: 10 x 25 Prob.: Error: Poly: 1.00 Szantai: Deak: MC: Genz: Dim: 15 x 20 Prob.: Error: Poly: 1.00 Szantai: 2.79 Deak: 4.37 MC: Genz: Dim: 15 x 25 Prob.: Error: Szantai: 1.00 Deak: MC: Genz: Poly: not available
20 Stabilität in Problemen mit separiertem Zufall R.H., W. Römisch (Math. Prog. 2004) gegebenes Optimierungsproblem: P min f xx X, F Ax p Verteilung von oft unbekannt. Approximation durch z.b. auf der Basis historischer Daten. Stabilität von Lösungen und Optimalwerten in (P) bei kleinen Störungen? Maß für Störung (Kolmogorov-Abstand): d K, sup z nf z F z Lösungsmengenabbildung: argmin f xx X,F Ax p Optimalwertfunktion: inf f xx X,F Ax p Originalproblem
21 Qualitative und quantitative Stabilität P min f xx X,F Ax p f konvex, X konvexundabgeschlossen, log F konvex Theorem: für viele multivariate Verteilungen erfüllt (Prekopa) Lösungsmenge von (P) nichtleer und beschränkt x X: F Ax p Slaterpunkt 1. ist oberhalbstetig i n 2. Ld K, lokal Falls zusätzlich: f linearquadratisch, X Polyeder, log F stark konvex 3. d H, Ld K, 12 lokal
22 Exponentielle Schranken für empirische Approximationen Ausgangsproblem: min f xx X,F Ax p Sei N eine Folge unabhängiger Zufallsvektoren. N Empirische Approximation: N : N 1 i1 i Dvoretzky-Kiefer-Wolfowitz Ungleichung: P d K N,C 1 expc 2 2 N Unter den Voraussetzungen des qualitativen Stabilitätsresultates folgt: 1 0 x N N : Pdx N, N , 0 : P N 2C 1 expc 2 N 2 L 2 Unter den Voraussetzungen des quantitativen Stabilitätsresultates folgt: 3 0, 0 : Pd H N, 2C 1 expc 2 N 4 L 4
Optimization Problems with Probabilistic Constraints
Optimization Problems with Probabilistic Constraints R. Henrion Weierstrass Institute Berlin 10 th International Conference on Stochastic Programming University of Arizona, Tucson Recommended Reading A.
More informationLipschitz and differentiability properties of quasi-concave and singular normal distribution functions
Ann Oper Res (2010) 177: 115 125 DOI 10.1007/s10479-009-0598-0 Lipschitz and differentiability properties of quasi-concave and singular normal distribution functions René Henrion Werner Römisch Published
More informationA gradient formula for linear chance constraints under Gaussian distribution
A gradient formula for linear chance constraints under Gaussian distribution René Henrion Weierstrass Institute Berlin, 10117 Berlin, Germany Andris Möller Weierstrass Institute Berlin, 10117 Berlin, Germany
More informationChance Constrained Problems
W eierstraß -Institut für Angew andte Analysis und Stochastik Chance Constrained Problems René Henrion Weierstraß-Institut Berlin August 15, 2009 Suggested Reading Contents Models (Examples, Linear Chance
More informationPROGRAMMING UNDER PROBABILISTIC CONSTRAINTS WITH A RANDOM TECHNOLOGY MATRIX
Math. Operationsforsch. u. Statist. 5 974, Heft 2. pp. 09 6. PROGRAMMING UNDER PROBABILISTIC CONSTRAINTS WITH A RANDOM TECHNOLOGY MATRIX András Prékopa Technological University of Budapest and Computer
More informationA CONVEXITY THEOREM IN PROGRAMMING UNDER PROBABILISTIC CONSTRAINTS
R u t c o r Research R e p o r t A CONVEXITY THEOREM IN PROGRAMMING UNDER PROBABILISTIC CONSTRAINTS András Prékopa a Mine Subasi b RRR 32-2007, December 2007 RUTCOR Rutgers Center for Operations Research
More informationChance constrained optimization - applications, properties and numerical issues
Chance constrained optimization - applications, properties and numerical issues Dr. Abebe Geletu Ilmenau University of Technology Department of Simulation and Optimal Processes (SOP) May 31, 2012 This
More information4. Convex optimization problems
Convex Optimization Boyd & Vandenberghe 4. Convex optimization problems optimization problem in standard form convex optimization problems quasiconvex optimization linear optimization quadratic optimization
More informationAmbiguity in portfolio optimization
May/June 2006 Introduction: Risk and Ambiguity Frank Knight Risk, Uncertainty and Profit (1920) Risk: the decision-maker can assign mathematical probabilities to random phenomena Uncertainty: randomness
More informationSharp bounds on the VaR for sums of dependent risks
Paul Embrechts Sharp bounds on the VaR for sums of dependent risks joint work with Giovanni Puccetti (university of Firenze, Italy) and Ludger Rüschendorf (university of Freiburg, Germany) Mathematical
More informationThe Multivariate Normal Distribution. In this case according to our theorem
The Multivariate Normal Distribution Defn: Z R 1 N(0, 1) iff f Z (z) = 1 2π e z2 /2. Defn: Z R p MV N p (0, I) if and only if Z = (Z 1,..., Z p ) T with the Z i independent and each Z i N(0, 1). In this
More informationORIGINS OF STOCHASTIC PROGRAMMING
ORIGINS OF STOCHASTIC PROGRAMMING Early 1950 s: in applications of Linear Programming unknown values of coefficients: demands, technological coefficients, yields, etc. QUOTATION Dantzig, Interfaces 20,1990
More informationStability of optimization problems with stochastic dominance constraints
Stability of optimization problems with stochastic dominance constraints D. Dentcheva and W. Römisch Stevens Institute of Technology, Hoboken Humboldt-University Berlin www.math.hu-berlin.de/~romisch SIAM
More informationPart IB Optimisation
Part IB Optimisation Theorems Based on lectures by F. A. Fischer Notes taken by Dexter Chua Easter 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after
More informationSemidefinite and Second Order Cone Programming Seminar Fall 2012 Project: Robust Optimization and its Application of Robust Portfolio Optimization
Semidefinite and Second Order Cone Programming Seminar Fall 2012 Project: Robust Optimization and its Application of Robust Portfolio Optimization Instructor: Farid Alizadeh Author: Ai Kagawa 12/12/2012
More informationConvex optimization problems. Optimization problem in standard form
Convex optimization problems optimization problem in standard form convex optimization problems linear optimization quadratic optimization geometric programming quasiconvex optimization generalized inequality
More informationcomponent risk analysis
273: Urban Systems Modeling Lec. 3 component risk analysis instructor: Matteo Pozzi 273: Urban Systems Modeling Lec. 3 component reliability outline risk analysis for components uncertain demand and uncertain
More informationA Representation of Excessive Functions as Expected Suprema
A Representation of Excessive Functions as Expected Suprema Hans Föllmer & Thomas Knispel Humboldt-Universität zu Berlin Institut für Mathematik Unter den Linden 6 10099 Berlin, Germany E-mail: foellmer@math.hu-berlin.de,
More informationReformulation of chance constrained problems using penalty functions
Reformulation of chance constrained problems using penalty functions Martin Branda Charles University in Prague Faculty of Mathematics and Physics EURO XXIV July 11-14, 2010, Lisbon Martin Branda (MFF
More informationarxiv: v2 [math.ap] 23 Apr 2014
Multi-marginal Monge-Kantorovich transport problems: A characterization of solutions arxiv:1403.3389v2 [math.ap] 23 Apr 2014 Abbas Moameni Department of Mathematics and Computer Science, University of
More informationRobustness in Stochastic Programs with Risk Constraints
Robustness in Stochastic Programs with Risk Constraints Dept. of Probability and Mathematical Statistics, Faculty of Mathematics and Physics Charles University, Prague, Czech Republic www.karlin.mff.cuni.cz/~kopa
More information3.3 Easy ILP problems and totally unimodular matrices
3.3 Easy ILP problems and totally unimodular matrices Consider a generic ILP problem expressed in standard form where A Z m n with n m, and b Z m. min{c t x : Ax = b, x Z n +} (1) P(b) = {x R n : Ax =
More informationMEAN VALUE METHODS IN ITERATION
506 W. R. MANN [June 2. H. Robbins and S. Monro, A stochastic approximation method, Ann. Math. Statist, vol. 22 (1951) pp. 400-407. 3. J. Wolfowitz, On the stochastic approximation method of Robbins and
More informationLecture 2: Linear Algebra Review
EE 227A: Convex Optimization and Applications January 19 Lecture 2: Linear Algebra Review Lecturer: Mert Pilanci Reading assignment: Appendix C of BV. Sections 2-6 of the web textbook 1 2.1 Vectors 2.1.1
More informationStochastic Optimization for Operating Chemical Processes under Uncertainty
Stochastic Optimization for Operating Chemical Processes under Uncertainty René Henrion 1,PuLi 2, Andris Möller 1, Marc C. Steinbach 3, Moritz Wendt 2, and Günter Wozny 2 1 Weierstraß-Institut für Angewandte
More informationA Linear Complementarity Time-Stepping Scheme for Rigid Multibody Dynamics with Nonsmooth Shapes. Gary D. Hart University of Pittsburgh
A Linear Complementarity Time-Stepping Scheme for Rigid Multibody Dynamics with Nonsmooth Shapes. Gary D. Hart University of Pittsburgh 1 Introduction Nonsmooth rigid multibody dynamics (NRMD) methods
More informationEMPIRICAL ESTIMATES IN STOCHASTIC OPTIMIZATION VIA DISTRIBUTION TAILS
K Y BERNETIKA VOLUM E 46 ( 2010), NUMBER 3, P AGES 459 471 EMPIRICAL ESTIMATES IN STOCHASTIC OPTIMIZATION VIA DISTRIBUTION TAILS Vlasta Kaňková Classical optimization problems depending on a probability
More informationA Minimax Theorem with Applications to Machine Learning, Signal Processing, and Finance
A Minimax Theorem with Applications to Machine Learning, Signal Processing, and Finance Seung Jean Kim Stephen Boyd Alessandro Magnani MIT ORC Sear 12/8/05 Outline A imax theorem Robust Fisher discriant
More informationRobust Process Control by Dynamic Stochastic Programming
Konrad-Zuse-Zentrum für Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Germany MARC C. STEINBACH Robust Process Control by Dynamic Stochastic Programming ZIB-Report 04-20 (May 2004) ROBUST
More informationConditioning of linear-quadratic two-stage stochastic programming problems
Conditioning of linear-quadratic two-stage stochastic programming problems W. Römisch Humboldt-University Berlin Institute of Mathematics http://www.math.hu-berlin.de/~romisch (K. Emich, R. Henrion) (WIAS
More information2 Chance constrained programming
2 Chance constrained programming In this Chapter we give a brief introduction to chance constrained programming. The goals are to motivate the subject and to give the reader an idea of the related difficulties.
More informationAuthor's personal copy
Comput Manag Sci (2015) 12:435 459 DOI 10.1007/s10287-015-0228-z ORIGINAL PAPER Probabilistic constraints via SQP solver: application to a renewable energy management problem I. Bremer R. Henrion A. Möller
More informationMultivariate Distributions
IEOR E4602: Quantitative Risk Management Spring 2016 c 2016 by Martin Haugh Multivariate Distributions We will study multivariate distributions in these notes, focusing 1 in particular on multivariate
More informationLecture 9: Dantzig-Wolfe Decomposition
Lecture 9: Dantzig-Wolfe Decomposition (3 units) Outline Dantzig-Wolfe decomposition Column generation algorithm Relation to Lagrangian dual Branch-and-price method Generated assignment problem and multi-commodity
More informationThomas Knispel Leibniz Universität Hannover
Optimal long term investment under model ambiguity Optimal long term investment under model ambiguity homas Knispel Leibniz Universität Hannover knispel@stochastik.uni-hannover.de AnStAp0 Vienna, July
More informationScenario generation in stochastic programming with application to energy systems
Scenario generation in stochastic programming with application to energy systems W. Römisch Humboldt-University Berlin Institute of Mathematics www.math.hu-berlin.de/~romisch SESO 2017 International Thematic
More information11. Equality constrained minimization
Convex Optimization Boyd & Vandenberghe 11. Equality constrained minimization equality constrained minimization eliminating equality constraints Newton s method with equality constraints infeasible start
More informationAirline Network Revenue Management by Multistage Stochastic Programming
Airline Network Revenue Management by Multistage Stochastic Programming K. Emich, H. Heitsch, A. Möller, W. Römisch Humboldt-University Berlin, Department of Mathematics Page 1 of 18 GOR-Arbeitsgruppe
More informationPart II: Integral Splittable Congestion Games. Existence and Computation of Equilibria Integral Polymatroids
Kombinatorische Matroids and Polymatroids Optimierung in der inlogistik Congestion undgames im Verkehr Tobias Harks Augsburg University WINE Tutorial, 8.12.2015 Outline Part I: Congestion Games Existence
More informationDual Decomposition.
1/34 Dual Decomposition http://bicmr.pku.edu.cn/~wenzw/opt-2017-fall.html Acknowledgement: this slides is based on Prof. Lieven Vandenberghes lecture notes Outline 2/34 1 Conjugate function 2 introduction:
More informationST5215: Advanced Statistical Theory
Department of Statistics & Applied Probability Wednesday, October 5, 2011 Lecture 13: Basic elements and notions in decision theory Basic elements X : a sample from a population P P Decision: an action
More informationSolving the MWT. Recall the ILP for the MWT. We can obtain a solution to the MWT problem by solving the following ILP:
Solving the MWT Recall the ILP for the MWT. We can obtain a solution to the MWT problem by solving the following ILP: max subject to e i E ω i x i e i C E x i {0, 1} x i C E 1 for all critical mixed cycles
More informationOPERATIONS RESEARCH. Linear Programming Problem
OPERATIONS RESEARCH Chapter 1 Linear Programming Problem Prof. Bibhas C. Giri Department of Mathematics Jadavpur University Kolkata, India Email: bcgiri.jumath@gmail.com MODULE - 2: Simplex Method for
More informationAnalysis and Linear Algebra. Lectures 1-3 on the mathematical tools that will be used in C103
Analysis and Linear Algebra Lectures 1-3 on the mathematical tools that will be used in C103 Set Notation A, B sets AcB union A1B intersection A\B the set of objects in A that are not in B N. Empty set
More informationSemidefinite Programming
Semidefinite Programming Notes by Bernd Sturmfels for the lecture on June 26, 208, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra The transition from linear algebra to nonlinear algebra has
More informationWerner Romisch. Humboldt University Berlin. Abstract. Perturbations of convex chance constrained stochastic programs are considered the underlying
Stability of solutions to chance constrained stochastic programs Rene Henrion Weierstrass Institute for Applied Analysis and Stochastics D-7 Berlin, Germany and Werner Romisch Humboldt University Berlin
More informationMobile Robotics 1. A Compact Course on Linear Algebra. Giorgio Grisetti
Mobile Robotics 1 A Compact Course on Linear Algebra Giorgio Grisetti SA-1 Vectors Arrays of numbers They represent a point in a n dimensional space 2 Vectors: Scalar Product Scalar-Vector Product Changes
More informationStochastic Programming: From statistical data to optimal decisions
Stochastic Programming: From statistical data to optimal decisions W. Römisch Humboldt-University Berlin Department of Mathematics (K. Emich, H. Heitsch, A. Möller) Page 1 of 24 6th International Conference
More informationAssignment 1 Math 5341 Linear Algebra Review. Give complete answers to each of the following questions. Show all of your work.
Assignment 1 Math 5341 Linear Algebra Review Give complete answers to each of the following questions Show all of your work Note: You might struggle with some of these questions, either because it has
More informationSample Average Approximation Method. for Chance Constrained Programming: Theory and Applications
Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications B.K. Pagnoncelli S. Ahmed A. Shapiro Communicated by P.M. Pardalos Abstract We study sample approximations
More informationDeterministic Operations Research, ME 366Q and ORI 391 Chapter 2: Homework #2 Solutions
Deterministic Operations Research, ME 366Q and ORI 391 Chapter 2: Homework #2 Solutions 11. Consider the following linear program. Maximize z = 6x 1 + 3x 2 subject to x 1 + 2x 2 2x 1 + x 2 20 x 1 x 2 x
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 5 Linear programming duality and sensitivity analysis
MVE165/MMG631 Linear and integer optimization with applications Lecture 5 Linear programming duality and sensitivity analysis Ann-Brith Strömberg 2017 03 29 Lecture 4 Linear and integer optimization with
More informationInformation Dimension
Information Dimension Mina Karzand Massachusetts Institute of Technology November 16, 2011 1 / 26 2 / 26 Let X would be a real-valued random variable. For m N, the m point uniform quantized version of
More informationJitka Dupačová and scenario reduction
Jitka Dupačová and scenario reduction W. Römisch Humboldt-University Berlin Institute of Mathematics http://www.math.hu-berlin.de/~romisch Session in honor of Jitka Dupačová ICSP 2016, Buzios (Brazil),
More informationALGORITHMS FOR MINIMIZING DIFFERENCES OF CONVEX FUNCTIONS AND APPLICATIONS
ALGORITHMS FOR MINIMIZING DIFFERENCES OF CONVEX FUNCTIONS AND APPLICATIONS Mau Nam Nguyen (joint work with D. Giles and R. B. Rector) Fariborz Maseeh Department of Mathematics and Statistics Portland State
More informationDiscrete Optimization
Prof. Friedrich Eisenbrand Martin Niemeier Due Date: March, 200 Discussions: February 25, March 04 Discrete Optimization Spring 200 s You can hand in written solutions for up to two of the exercises marked
More informationMachine learning comes from Bayesian decision theory in statistics. There we want to minimize the expected value of the loss function.
Bayesian learning: Machine learning comes from Bayesian decision theory in statistics. There we want to minimize the expected value of the loss function. Let y be the true label and y be the predicted
More informationSupermodular ordering of Poisson arrays
Supermodular ordering of Poisson arrays Bünyamin Kızıldemir Nicolas Privault Division of Mathematical Sciences School of Physical and Mathematical Sciences Nanyang Technological University 637371 Singapore
More informationReal-Time Optimization (RTO)
Real-Time Optimization (RTO) In previous chapters we have emphasized control system performance for disturbance and set-point changes. Now we will be concerned with how the set points are specified. In
More informationA note on scenario reduction for two-stage stochastic programs
A note on scenario reduction for two-stage stochastic programs Holger Heitsch a and Werner Römisch a a Humboldt-University Berlin, Institute of Mathematics, 199 Berlin, Germany We extend earlier work on
More information3 Development of the Simplex Method Constructing Basic Solution Optimality Conditions The Simplex Method...
Contents Introduction to Linear Programming Problem. 2. General Linear Programming problems.............. 2.2 Formulation of LP problems.................... 8.3 Compact form and Standard form of a general
More informationGeneralized Convexity in Economics
Generalized Convexity in Economics J.E. Martínez-Legaz Universitat Autònoma de Barcelona, Spain 2nd Summer School: Generalized Convexity Analysis Introduction to Theory and Applications JULY 19, 2008 KAOHSIUNG
More informationMultivariable Calculus
2 Multivariable Calculus 2.1 Limits and Continuity Problem 2.1.1 (Fa94) Let the function f : R n R n satisfy the following two conditions: (i) f (K ) is compact whenever K is a compact subset of R n. (ii)
More informationSection Notes 9. Midterm 2 Review. Applied Math / Engineering Sciences 121. Week of December 3, 2018
Section Notes 9 Midterm 2 Review Applied Math / Engineering Sciences 121 Week of December 3, 2018 The following list of topics is an overview of the material that was covered in the lectures and sections
More informationTechnische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik. Combinatorial Optimization (MA 4502)
Technische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik Combinatorial Optimization (MA 4502) Dr. Michael Ritter Problem Sheet 1 Homework Problems Exercise
More informationDistributionally Robust Discrete Optimization with Entropic Value-at-Risk
Distributionally Robust Discrete Optimization with Entropic Value-at-Risk Daniel Zhuoyu Long Department of SEEM, The Chinese University of Hong Kong, zylong@se.cuhk.edu.hk Jin Qi NUS Business School, National
More informationComplexity of two and multi-stage stochastic programming problems
Complexity of two and multi-stage stochastic programming problems A. Shapiro School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205, USA The concept
More informationStochastic Subgradient Methods
Stochastic Subgradient Methods Stephen Boyd and Almir Mutapcic Notes for EE364b, Stanford University, Winter 26-7 April 13, 28 1 Noisy unbiased subgradient Suppose f : R n R is a convex function. We say
More informationChapter 2: Preliminaries and elements of convex analysis
Chapter 2: Preliminaries and elements of convex analysis Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-14-15.shtml Academic year 2014-15
More informationScenario estimation and generation
October 10, 2004 The one-period case Distances of Probability Measures Tensor products of trees Tree reduction A decision problem is subject to uncertainty Uncertainty is represented by probability To
More informationIntroduction and Math Preliminaries
Introduction and Math Preliminaries Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/ yyye Appendices A, B, and C, Chapter
More informationSOME REMARKS ON KRASNOSELSKII S FIXED POINT THEOREM
Fixed Point Theory, Volume 4, No. 1, 2003, 3-13 http://www.math.ubbcluj.ro/ nodeacj/journal.htm SOME REMARKS ON KRASNOSELSKII S FIXED POINT THEOREM CEZAR AVRAMESCU AND CRISTIAN VLADIMIRESCU Department
More informationRISK AND RELIABILITY IN OPTIMIZATION UNDER UNCERTAINTY
RISK AND RELIABILITY IN OPTIMIZATION UNDER UNCERTAINTY Terry Rockafellar University of Washington, Seattle AMSI Optimise Melbourne, Australia 18 Jun 2018 Decisions in the Face of Uncertain Outcomes = especially
More informationR u t c o r Research R e p o r t. Application of the Solution of the Univariate Discrete Moment Problem for the Multivariate Case. Gergely Mádi-Nagy a
R u t c o r Research R e p o r t Application of the Solution of the Univariate Discrete Moment Problem for the Multivariate Case Gergely Mádi-Nagy a RRR 9-28, April 28 RUTCOR Rutgers Center for Operations
More informationEcon 2148, spring 2019 Statistical decision theory
Econ 2148, spring 2019 Statistical decision theory Maximilian Kasy Department of Economics, Harvard University 1 / 53 Takeaways for this part of class 1. A general framework to think about what makes a
More informationSilvia Vogel. Random Approximations in Multiobjective Optimization. Ilmenau University of Technology Weimarer Strae Ilmenau Germany
Silvia Vogel Random Approximations in Multiobjective Optimization Ilmenau University of Technology Weimarer Strae 25 98693 Ilmenau Germany E-mail: Silvia.Vogel@tu-ilmenau.de Tel. +49 3677 693626 Fax: +49
More informationSOME HISTORY OF STOCHASTIC PROGRAMMING
SOME HISTORY OF STOCHASTIC PROGRAMMING Early 1950 s: in applications of Linear Programming unknown values of coefficients: demands, technological coefficients, yields, etc. QUOTATION Dantzig, Interfaces
More informationOuter limits of subdifferentials for min-max type functions
Outer limits of subdifferentials for min-max type functions Andrew Eberhard, Vera Roshchina, Tian Sang August 31, 2017 arxiv:1701.02852v2 [math.oc] 30 Aug 2017 Abstract We generalise the outer subdifferential
More information1 Integer Decomposition Property
CS 598CSC: Combinatorial Optimization Lecture date: Feb 2, 2010 Instructor: Chandra Chekuri Scribe: Siva Theja Maguluri Material taken mostly from [1] (Chapter 19). 1 Integer Decomposition Property A polyhedron
More informationAsymptotics of minimax stochastic programs
Asymptotics of minimax stochastic programs Alexander Shapiro Abstract. We discuss in this paper asymptotics of the sample average approximation (SAA) of the optimal value of a minimax stochastic programming
More informationLinear and Integer Programming - ideas
Linear and Integer Programming - ideas Paweł Zieliński Institute of Mathematics and Computer Science, Wrocław University of Technology, Poland http://www.im.pwr.wroc.pl/ pziel/ Toulouse, France 2012 Literature
More informationA direct formulation for sparse PCA using semidefinite programming
A direct formulation for sparse PCA using semidefinite programming A. d Aspremont, L. El Ghaoui, M. Jordan, G. Lanckriet ORFE, Princeton University & EECS, U.C. Berkeley A. d Aspremont, INFORMS, Denver,
More informationSeminars on Mathematics for Economics and Finance Topic 5: Optimization Kuhn-Tucker conditions for problems with inequality constraints 1
Seminars on Mathematics for Economics and Finance Topic 5: Optimization Kuhn-Tucker conditions for problems with inequality constraints 1 Session: 15 Aug 2015 (Mon), 10:00am 1:00pm I. Optimization with
More informationLinear programs, convex polyhedra, extreme points
MVE165/MMG631 Extreme points of convex polyhedra; reformulations; basic feasible solutions; the simplex method Ann-Brith Strömberg 2015 03 27 Linear programs, convex polyhedra, extreme points A linear
More informationChapter 1: Linear Programming
Chapter 1: Linear Programming Math 368 c Copyright 2013 R Clark Robinson May 22, 2013 Chapter 1: Linear Programming 1 Max and Min For f : D R n R, f (D) = {f (x) : x D } is set of attainable values of
More informationPARTIAL REGULARITY OF BRENIER SOLUTIONS OF THE MONGE-AMPÈRE EQUATION
PARTIAL REGULARITY OF BRENIER SOLUTIONS OF THE MONGE-AMPÈRE EQUATION ALESSIO FIGALLI AND YOUNG-HEON KIM Abstract. Given Ω, Λ R n two bounded open sets, and f and g two probability densities concentrated
More informationNUMERICAL METHODS FOR PROBABILISTIC CONSTRAINED OPTIMIZATION PROBLEM WHERE RANDOM VARIABLES HAVE DEGENERATE CONTINUOUS DISTRIBUTION.
NUMERICAL METHODS FOR PROBABILISTIC CONSTRAINED OPTIMIZATION PROBLEM WHERE RANDOM VARIABLES HAVE DEGENERATE CONTINUOUS DISTRIBUTION. BY OLGA MYNDYUK A dissertation submitted to the Graduate School New
More informationCovariograms of convex bodies in the plane: A remark on Nagel s theorem
Elem. Math. 57 (00) 61 65 0013-6018/0/00061-5 $ 1.50+0.0/0 c Birkhäuser Verlag, Basel, 00 Elemente der Mathematik Covariograms of convex bodies in the plane: A remark on Nagel s theorem Daniel Neuenschwander
More informationLINEAR INTERVAL INEQUALITIES
LINEAR INTERVAL INEQUALITIES Jiří Rohn, Jana Kreslová Faculty of Mathematics and Physics, Charles University Malostranské nám. 25, 11800 Prague, Czech Republic 1.6.1993 Abstract We prove that a system
More informationDependence. MFM Practitioner Module: Risk & Asset Allocation. John Dodson. September 11, Dependence. John Dodson. Outline.
MFM Practitioner Module: Risk & Asset Allocation September 11, 2013 Before we define dependence, it is useful to define Random variables X and Y are independent iff For all x, y. In particular, F (X,Y
More informationSHADOWING AND INVERSE SHADOWING IN SET-VALUED DYNAMICAL SYSTEMS. HYPERBOLIC CASE. Sergei Yu. Pilyugin Janosch Rieger. 1.
Topological Methods in Nonlinear Analysis Journal of the Juliusz Schauder Center Volume 32, 2008, 151 164 SHADOWING AND INVERSE SHADOWING IN SET-VALUED DYNAMICAL SYSTEMS. HYPERBOLIC CASE Sergei Yu. Pilyugin
More informationLinear Programming Methods
Chapter 11 Linear Programming Methods 1 In this chapter we consider the linear programming approach to dynamic programming. First, Bellman s equation can be reformulated as a linear program whose solution
More informationMulticommodity Flows and Column Generation
Lecture Notes Multicommodity Flows and Column Generation Marc Pfetsch Zuse Institute Berlin pfetsch@zib.de last change: 2/8/2006 Technische Universität Berlin Fakultät II, Institut für Mathematik WS 2006/07
More informationn! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2
Order statistics Ex. 4. (*. Let independent variables X,..., X n have U(0, distribution. Show that for every x (0,, we have P ( X ( < x and P ( X (n > x as n. Ex. 4.2 (**. By using induction or otherwise,
More informationLecture notes on statistical decision theory Econ 2110, fall 2013
Lecture notes on statistical decision theory Econ 2110, fall 2013 Maximilian Kasy March 10, 2014 These lecture notes are roughly based on Robert, C. (2007). The Bayesian choice: from decision-theoretic
More informationMulti-dimensional Stochastic Singular Control Via Dynkin Game and Dirichlet Form
Multi-dimensional Stochastic Singular Control Via Dynkin Game and Dirichlet Form Yipeng Yang * Under the supervision of Dr. Michael Taksar Department of Mathematics University of Missouri-Columbia Oct
More informationIntroduction to Mobile Robotics Compact Course on Linear Algebra. Wolfram Burgard, Cyrill Stachniss, Maren Bennewitz, Diego Tipaldi, Luciano Spinello
Introduction to Mobile Robotics Compact Course on Linear Algebra Wolfram Burgard, Cyrill Stachniss, Maren Bennewitz, Diego Tipaldi, Luciano Spinello Vectors Arrays of numbers Vectors represent a point
More informationA direct formulation for sparse PCA using semidefinite programming
A direct formulation for sparse PCA using semidefinite programming A. d Aspremont, L. El Ghaoui, M. Jordan, G. Lanckriet ORFE, Princeton University & EECS, U.C. Berkeley Available online at www.princeton.edu/~aspremon
More informationNON-STANDARD PARTIAL INTEGRATION: IMPLICATIONS TO MAXWELL AND KORN INEQUALITIES OR HOW ONE CANNOT APPLY THE CLOSED GRAPH THEOREM!
NON-STANDARD PARTIAL INTEGRATION: IMPLICATIONS TO MAXWELL AND KORN INEQUALITIES OR HOW ONE CANNOT APPLY THE CLOSED GRAPH THEOREM! LINZ 2015 RADON GROUP SEMINARS: COMPUTATIONAL METHODS FOR DIRECT FIELD
More informationChapter 4: Interpolation and Approximation. October 28, 2005
Chapter 4: Interpolation and Approximation October 28, 2005 Outline 1 2.4 Linear Interpolation 2 4.1 Lagrange Interpolation 3 4.2 Newton Interpolation and Divided Differences 4 4.3 Interpolation Error
More information