BENSOLVE - a solver for multi-objective linear programs
|
|
- Franklin Hutchinson
- 6 years ago
- Views:
Transcription
1 BENSOLVE - a solver for multi-objective linear programs Andreas Löhne Martin-Luther-Universität Halle-Wittenberg, Germany ISMP 2012 Berlin, August 19-24, 2012
2 BENSOLVE is a solver project based on Benson's outer approximation algorithm aims is to establish an open source tool to solve linear vector optimization problems is still at the very beginning is open to contributions
3 Linear vector optimization problem (P) Minimize P : R n R q w.r.t. C over S = {x Ax b} P... (q n)-matrix C... ordering cone in R q : polyhedral, convex, pointed, solid x C y : y x C x < C y : y x int C A... (m n)-matrix b... vector in R m
4 Linear vector optimization problem - equivalent formulation Compute where P [S] + C P [S] := {P x x S}, P R q n S := {x R n Ax b}, A R m n, b R m C := { y R q Z T y 0 }, Z R q p, p q
5 Polyhedra P... convex polyhedron in R q H-representation... intersection of halfspaces: P = r i=1 { y R q (v i ) T y γ i } V-representation... generalized convex hull of generating points y 1,... y r R q and generating directions k 1,... k s R q \ {0}: P = conv (y 1,..., y s ) + cone (k 1,..., k t )
6 Problem Compute where P [S] + C P [S] := {P x x S}, P R q n S := {x R n Ax b}, A R m n, b R m C := { y R q Z T y 0 }, Z R q p
7 Special case: q=1 Compute where p T [S] + R + p T [S] := { p T x x S }, p R n S := {x R n Ax b}, A R m n, b R m Linear Program
8 In which sense are the problems equivalent? Compute the set P := P [S] + C Solve (P) bd P = wmin P (boundary point verication by H-representation) every vertex of P is minimal (ecient, nondominated) a weakly minimal point of P is minimal i it belongs to a supporting hyperplane of P with normal vector in int C + (no LPs to be solved) facets of P can be obtained if we have both an H-representation and a V-representation of P (no LPs to be solved)
9 Example (P) Minimize P : R n R q w.r.t. over S := {x R n Bx b} P = ( ), B = , b =
10 Example y 2 y 2 6 P = P [S] + R q + 4 S 2 y y 1 Solution to (P): S = {( 0 6 ), ( 2 2 )}, S h = {( 0 1 )}
11 Example y 2 y 2 6 P = P [S] + R q + 4 S 2 y y 1 Solution to (P): S = {( 0 6 ), ( 2 2 )}, S h = {( 0 1 )}
12 Example y 2 y 2 6 P = P [S] + R q + 4 S 2 y y 1 Solution ( S, S h ) to (P): S = {( 0 6 ), ( 2 2 )}, S h = {( 0 1 )}
13 Example D = D [T ] K 6 P = P [S] + R q + y 1 y 2 y 2 y Solution T to (D ): T = , ,
14 Algorithm P [S]
15 Algorithm P := P [S] + C Notation: P := P [S] + C
16 Weighted sum scalarization (P 1 (w)) min w T P x s.t. Ax b (D 1 (w)) max b T u s.t. A T u = P T w, u 0 w... columns of Z C := { y R q Z T y 0 }
17 Algorithm P := P [S] + C
18 Algorithm T t
19 Translative scalarization (P 2 (y)) min z s.t. Ax b, Z T P x Z T y + z Z T c y R q, c int C
20 Translative scalarization (P 2 (y)) min z s.t. Ax b, Z T P x Z T y + z Z T c y R q, c int C
21 Translative scalarization (P 2 (y)) min z s.t. Ax b, Z T P x Z T y + z Z T c ( D 2 (y)) max b T u y T Zv subject to A T u P T Zv = 0 c T Zv = 1 (u, v) 0. (D 2 (y)) max b T u y T w subject to A T u P T w = 0 c T w = 1 Y T w 0 u 0, Y... matrix whose columns are generating vectors of C Z... matrix whose columns are generating vectors of C + Y T w 0 y C : y T w 0 w C + v 0 : w = Zv
22 Translative scalarization Proposition. Let S and c int C. For every t R q, there exist optimal solutions ( x, z) to (P 2 (t)) and (ū, w) to (D 2 (t)). Each solution (ū, w) to (D 2 (t)) denes a supporting hyperplane H := { y R q w T y = b T ū } of P := P [S] + C such that s := t + z c H P. We have t P z < 0, t bd P z = 0, t int P z > 0.
23 Algorithm T t
24 Algorithm T t H
25 Algorithm
26 Algorithm t H
27 Algorithm t 1 t 2
28 Benson's Algorithm... Original variant: Benson 1998 Dual algorithm: Ehrgott/L./Shao 2007/2012 Extension for unbounded problems: L Extension to pointed polyhedral ordering cones with nonempty interior: Hamel/L./Rudlo 2012 All LVOPs with polyhedral pointed solid odering cone can be solved (at least theoretically).
29 New variant of Benson's algorithm Input: Ha B, b, P, Z (data of (P)); Ha a solution ({0}, S h ) to (P h ); Ha a solution T h to (D h ); Output: Ha ( S, S h ) is a solution to (P); Ha T is a solution to (D ); Ha ( T p, ˆT p) is a V -representation of P; Ha ( T d, (0,..., 0, 1) T ) is a V -representation of D ;
30 Ha T {( solve(d 1 (w)), w ) (u, w) T h} ; Ha ag true; Ha while (ag) HaHa ag false; HaHa S ; HaHa T d { D (u, w) (u, w) T } ; HaHa (T p, ˆT p ) dual(t d, (0,..., 0, 1) T ); HaHa for i = 1 to T p do HaHaHa t T p [i]; HaHaHa (x, z, u, w) solve(p 2 (t)/d 2 (t)); HaHaHa if z 0 HaHaHaHa T T {(u, w)}; HaHaHaHa ag=true; HaHaHaHa break; (optional) HaHaHa else HaHaHaHa S S {x}; HaHaHa end; HaHa end; Ha end;
31 BENSOLVE - Matlab implementation: Example 1 B=[ ; ]'; b=[ ]'; P=[1-1; 1 1]; [S,Sh,T,PP,PPh,DD]=bensolve(P,B,b)
32 S = Sh = 0 1 T = PP = PPh = DD =
33 BENSOLVE - Matlab implementation: Example 2 B=[eye(3);ones(1,3);1 2 2;2 2 1;2 1 2]; b=[ /2 3/2 3/2]'; P=[1 1 0;0 1 1;1 0 1]'; Y=[1 0 0 ; ; ; 0-1 2]'; clear options; options.vert_enum='c'; [S,Sh,T,PP,PPh,DD]=bensolve(P,B,b,Y,[],[],options); plotresult(pp,pph,dd);
34 BENSOLVE - Matlab implementation
35 BENSOLVE - Matlab implementation dierent variants of vertex enumeration using: CDDLIB (by Komei Fukuda) the matlab function convhulln (based on the QHULL project)
36 BENSOLVE - Matlab implementation dierent LP solvers: (MATLAB linprog) GLPK (GNU Linear Programming Kit) CDDLIB
37 BENSOLVE - C++ library and executable (not yet released) vertex enumeration using CDDLIB with rational arithmetic (GMP) LP solvers: GLPK, CDDLIB/GMP graphical outputs via JAVAVIEW
38 Applications in Finance (a) Superhedging in markets with transaction costs [L./Rudlo (2011)] (b) Set-valued measures of risk [Hamel/Heyde (2010) Hamel/Rudlo/Yankova (2011) Hamel/L./Rudlo (2012) Heyde/Weiÿing (2012)...]
39 stock EUR bid price ask price
40 stock 1 B A 8 10 EUR bid price ask price
41 stock 1 B A 8 10 EUR bid price ask price
42 stock 1 K 8 10 EUR bid price ask price
43 Example superhedging digital option (all-or-nothing option, binary option) 20, 26 18, 25 16, 23 t = 0 t = T X(ω) = (X 1 (ω), X 2 (ω)) = (0, I {S at K} (ω) ) strike price K = 24 X(ω 1 ) = (0, 1) T, X(ω 2 ) = (0, 0) T
44 Example superhedging stock P 1 SHP 0 (X) P 1 K 0 P P P 2 cash
45 Problems solved using BENSOLVE: (a) Superhedging q = 2 assets, 1800 time steps (> 1.6 Million small LVOPs) q = 3 assets, 20 time steps (2870 small LVOPs) typical: n q, (# generating vectors of C) q (b) Set-valued measures of risk n 500, m 500 q = 2, 3, 4, 5 typical: n >> q, (# generating vectors of C) q
46 Choice of literature Benson, H. P.: An outer approximation algorithm for generating all ecient extreme points in the outcome set of a multiple objective linear programming problem. Journal of Global Optimization 13, 124 (1998) Ehrgott, M.; Löhne, A.; Shao, L.: A dual variant of Benson's outer approximation algorithm. J. Glob. Opt. 52 (4), (2011) (submitted 2007) Ehrgott, M.; Shao, L.; Schöbel, A.: An approximation algorithm for convex multi-objective programming problems. J. Glob. Opt. 50, 397-?416 (2011) Hamel, A., Heyde, F.: Duality for set-valued measures of risk. SIAM J. on Financial Mathematics 1 (1), 6695 (2010) Hamel, A., Heyde, F., Rudlo, B.: Set-valued risk measures for conical market models. Mathematics and Financial Economics 5 (1), 128 (2011) Hamel, A., Löhne, A., Rudlo, B.: Linear vector optimization, algorithms and applications to nancial markets with frictions, draft Heyde, F., Löhne, A.: Solution concepts in vector optimization. A fresh look at an old story. Optimization, 60 (12), (2011) Heyde, F., Löhne, A.: Geometric duality in multiple objective linear programming. SIAM Journal of Optimization 19 (2), (2008) Löhne, A.; Rudlo, B.: An algorithm for calculating the set of superhedging portfolios and strategies in markets with transaction costs, submitted Löhne, A.: Vector optimization with inmum and supremum. Springer (2011) Shao, L. and Ehrgott, M.: Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning. Math. Methods Oper. Res. 68(2), (2008)
Linear Vector Optimization. Algorithms and Applications
Linear Vector Optimization. Algorithms and Applications Andreas Löhne Martin-Luther-Universität Halle-Wittenberg, Germany ANZIAM 2013 Newcastle (Australia), February 4, 2013 based on Hamel, A.; Löhne,
More informationCalculating the set of superhedging portfolios in markets with transactions costs by methods of vector optimization
Calculating the set of superhedging portfolios in markets with transactions costs by methods of vector optimization Andreas Löhne Martin-Luther-Universität Halle-Wittenberg Co-author: Birgit Rudlo, Princeton
More informationA Dual Variant of Benson s Outer Approximation Algorithm
A Dual Variant of Benson s Outer Approximation Algorithm Matthias Ehrgott Department of Engineering Science The University of Auckland, New Zealand email: m.ehrgott@auckland.ac.nz and Laboratoire d Informatique
More informationA Parametric Simplex Algorithm for Linear Vector Optimization Problems
A Parametric Simplex Algorithm for Linear Vector Optimization Problems Birgit Rudloff Firdevs Ulus Robert Vanderbei July 9, 2015 Abstract In this paper, a parametric simplex algorithm for solving linear
More informationSet-valued Duality Theory for Multiple Objective Linear Programs and Application to Mathematical Finance
Set-valued Duality Theory for Multiple Objective Linear Programs and Application to Mathematical Finance Frank Heyde Andreas Löhne Christiane Tammer December 5, 2006 Abstract We develop a duality theory
More informationClosing the Duality Gap in Linear Vector Optimization
Journal of Convex Analysis Volume 11 (2004), No. 1, 163 178 Received July 4, 2003 Closing the Duality Gap in Linear Vector Optimization Andreas H. Hamel Martin-Luther-University Halle-Wittenberg, Department
More informationClosing the duality gap in linear vector optimization
Closing the duality gap in linear vector optimization Andreas H. Hamel Frank Heyde Andreas Löhne Christiane Tammer Kristin Winkler Abstract Using a set-valued dual cost function we give a new approach
More informationarxiv: v3 [math.oc] 16 May 2018
arxiv:1702.05645v3 [math.oc] 16 May 2018 Tractability of Convex Vector Optimization Problems in the Sense of Polyhedral Approximations Firdevs Ulus September 18, 2018 Abstract There are different solution
More informationFrom the Zonotope Construction to the Minkowski Addition of Convex Polytopes
From the Zonotope Construction to the Minkowski Addition of Convex Polytopes Komei Fukuda School of Computer Science, McGill University, Montreal, Canada Abstract A zonotope is the Minkowski addition of
More informationClassical linear vector optimization duality revisited
Optim Lett DOI 10.1007/s11590-010-0263-1 ORIGINAL PAPER Classical linear vector optimization duality revisited Radu Ioan Boţ Sorin-Mihai Grad Gert Wanka Received: 6 May 2010 / Accepted: 8 November 2010
More informationChapter 1. Preliminaries
Introduction This dissertation is a reading of chapter 4 in part I of the book : Integer and Combinatorial Optimization by George L. Nemhauser & Laurence A. Wolsey. The chapter elaborates links between
More informationSet-Valued Risk Measures and Bellman s Principle
Set-Valued Risk Measures and Bellman s Principle Zach Feinstein Electrical and Systems Engineering, Washington University in St. Louis Joint work with Birgit Rudloff (Vienna University of Economics and
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 informationOptimization WS 13/14:, by Y. Goldstein/K. Reinert, 9. Dezember 2013, 16: Linear programming. Optimization Problems
Optimization WS 13/14:, by Y. Goldstein/K. Reinert, 9. Dezember 2013, 16:38 2001 Linear programming Optimization Problems General optimization problem max{z(x) f j (x) 0,x D} or min{z(x) f j (x) 0,x D}
More informationLP Duality: outline. Duality theory for Linear Programming. alternatives. optimization I Idea: polyhedra
LP Duality: outline I Motivation and definition of a dual LP I Weak duality I Separating hyperplane theorem and theorems of the alternatives I Strong duality and complementary slackness I Using duality
More informationLP Relaxations of Mixed Integer Programs
LP Relaxations of Mixed Integer Programs John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA February 2015 Mitchell LP Relaxations 1 / 29 LP Relaxations LP relaxations We want
More informationarxiv: v2 [q-fin.rm] 10 Sep 2017
Set-valued shortfall and divergence risk measures Çağın Ararat Andreas H. Hamel Birgit Rudloff September 10, 2017 arxiv:1405.4905v2 [q-fin.rm] 10 Sep 2017 Abstract Risk measures for multivariate financial
More informationAsteroide Santana, Santanu S. Dey. December 4, School of Industrial and Systems Engineering, Georgia Institute of Technology
for Some for Asteroide Santana, Santanu S. Dey School of Industrial Systems Engineering, Georgia Institute of Technology December 4, 2016 1 / 38 1 1.1 Conic integer programs for Conic integer programs
More informationOn Semicontinuity of Convex-valued Multifunctions and Cesari s Property (Q)
On Semicontinuity of Convex-valued Multifunctions and Cesari s Property (Q) Andreas Löhne May 2, 2005 (last update: November 22, 2005) Abstract We investigate two types of semicontinuity for set-valued
More informationNumerical Optimization
Linear Programming Computer Science and Automation Indian Institute of Science Bangalore 560 012, India. NPTEL Course on min x s.t. Transportation Problem ij c ijx ij 3 j=1 x ij a i, i = 1, 2 2 i=1 x ij
More informationCO 250 Final Exam Guide
Spring 2017 CO 250 Final Exam Guide TABLE OF CONTENTS richardwu.ca CO 250 Final Exam Guide Introduction to Optimization Kanstantsin Pashkovich Spring 2017 University of Waterloo Last Revision: March 4,
More informationLecture 1 Introduction
L. Vandenberghe EE236A (Fall 2013-14) Lecture 1 Introduction course overview linear optimization examples history approximate syllabus basic definitions linear optimization in vector and matrix notation
More informationMAT-INF4110/MAT-INF9110 Mathematical optimization
MAT-INF4110/MAT-INF9110 Mathematical optimization Geir Dahl August 20, 2013 Convexity Part IV Chapter 4 Representation of convex sets different representations of convex sets, boundary polyhedra and polytopes:
More informationLecture 1: Background on Convex Analysis
Lecture 1: Background on Convex Analysis John Duchi PCMI 2016 Outline I Convex sets 1.1 Definitions and examples 2.2 Basic properties 3.3 Projections onto convex sets 4.4 Separating and supporting hyperplanes
More informationThe Asymptotic Theory of Transaction Costs
The Asymptotic Theory of Transaction Costs Lecture Notes by Walter Schachermayer Nachdiplom-Vorlesung, ETH Zürich, WS 15/16 1 Models on Finite Probability Spaces In this section we consider a stock price
More informationDETECTION OF FXM ARBITRAGE AND ITS SENSITIVITY
DETECTION OF FXM ARBITRAGE AND ITS SENSITIVITY SFI FINANCIAL ALGEBRA PROJECT AT UCC: BH, AM & EO S 1. Definitions and basics In this working paper we have n currencies, labeled 1 through n inclusive and
More informationLecture 1: Convex Sets January 23
IE 521: Convex Optimization Instructor: Niao He Lecture 1: Convex Sets January 23 Spring 2017, UIUC Scribe: Niao He Courtesy warning: These notes do not necessarily cover everything discussed in the class.
More informationComputing Efficient Solutions of Nonconvex Multi-Objective Problems via Scalarization
Computing Efficient Solutions of Nonconvex Multi-Objective Problems via Scalarization REFAIL KASIMBEYLI Izmir University of Economics Department of Industrial Systems Engineering Sakarya Caddesi 156, 35330
More informationLECTURE 25: REVIEW/EPILOGUE LECTURE OUTLINE
LECTURE 25: REVIEW/EPILOGUE LECTURE OUTLINE CONVEX ANALYSIS AND DUALITY Basic concepts of convex analysis Basic concepts of convex optimization Geometric duality framework - MC/MC Constrained optimization
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology 18.433: Combinatorial Optimization Michel X. Goemans February 28th, 2013 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the introductory
More informationThursday, May 24, Linear Programming
Linear Programming Linear optimization problems max f(x) g i (x) b i x j R i =1,...,m j =1,...,n Optimization problem g i (x) f(x) When and are linear functions Linear Programming Problem 1 n max c x n
More informationMulti-criteria decision making via multivariate quantiles
Multi-criteria decision making via multivariate quantiles arxiv:1807.05949v1 [stat.ap] 16 Jul 2018 Daniel Kostner July 17, 2018 Abstract A novel approach for solving a multiple judge, multiple criteria
More informationEfficient portfolios in financial markets with proportional transaction costs
Joint work E. Jouini and V. Portes Conference in honour of Walter Schachermayer, July 2010 Contents 1 2 3 4 : An efficient portfolio is an admissible portfolio which is optimal for at least one agent.
More information1 Maximal Lattice-free Convex Sets
47-831: Advanced Integer Programming Lecturer: Amitabh Basu Lecture 3 Date: 03/23/2010 In this lecture, we explore the connections between lattices of R n and convex sets in R n. The structures will prove
More informationHandout 4: Some Applications of Linear Programming
ENGG 5501: Foundations of Optimization 2018 19 First Term Handout 4: Some Applications of Linear Programming Instructor: Anthony Man Cho So October 15, 2018 1 Introduction The theory of LP has found many
More informationLMI MODELLING 4. CONVEX LMI MODELLING. Didier HENRION. LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ. Universidad de Valladolid, SP March 2009
LMI MODELLING 4. CONVEX LMI MODELLING Didier HENRION LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ Universidad de Valladolid, SP March 2009 Minors A minor of a matrix F is the determinant of a submatrix
More informationLinear and Combinatorial Optimization
Linear and Combinatorial Optimization The dual of an LP-problem. Connections between primal and dual. Duality theorems and complementary slack. Philipp Birken (Ctr. for the Math. Sc.) Lecture 3: Duality
More informationMonetary Risk Measures and Generalized Prices Relevant to Set-Valued Risk Measures
Applied Mathematical Sciences, Vol. 8, 2014, no. 109, 5439-5447 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.43176 Monetary Risk Measures and Generalized Prices Relevant to Set-Valued
More informationCONDITIONAL ACCEPTABILITY MAPPINGS AS BANACH-LATTICE VALUED MAPPINGS
CONDITIONAL ACCEPTABILITY MAPPINGS AS BANACH-LATTICE VALUED MAPPINGS RAIMUND KOVACEVIC Department of Statistics and Decision Support Systems, University of Vienna, Vienna, Austria Abstract. Conditional
More informationLinear Programming Inverse Projection Theory Chapter 3
1 Linear Programming Inverse Projection Theory Chapter 3 University of Chicago Booth School of Business Kipp Martin September 26, 2017 2 Where We Are Headed We want to solve problems with special structure!
More informationRobust pricing hedging duality for American options in discrete time financial markets
Robust pricing hedging duality for American options in discrete time financial markets Anna Aksamit The University of Sydney based on joint work with Shuoqing Deng, Jan Ob lój and Xiaolu Tan Robust Techniques
More informationGenerating All Efficient Extreme Points in Multiple Objective Linear Programming Problem and Its Application
Generating All Efficient Extreme Points in Multiple Objective Linear Programming Problem and Its Application Nguyen Thi Bach Kim and Nguyen Tuan Thien Faculty of Applied Mathematics and Informatics, Hanoi
More informationLinear Programming: Simplex
Linear Programming: Simplex Stephen J. Wright 1 2 Computer Sciences Department, University of Wisconsin-Madison. IMA, August 2016 Stephen Wright (UW-Madison) Linear Programming: Simplex IMA, August 2016
More informationIE 5531: Engineering Optimization I
IE 5531: Engineering Optimization I Lecture 1: Introduction Prof. John Gunnar Carlsson September 8, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I September 8, 2010 1 / 35 Administrivia
More informationExploiting Symmetry in Computing Polyhedral Bounds on Network Coding Rate Regions
Exploiting Symmetry in Computing Polyhedral Bounds on Network Coding Rate Regions Jayant Apte John Walsh Department of Electrical and Computer Engineering Drexel University, Philadelphia NetCod, 205 NSF
More informationA Simple Computational Approach to the Fundamental Theorem of Asset Pricing
Applied Mathematical Sciences, Vol. 6, 2012, no. 72, 3555-3562 A Simple Computational Approach to the Fundamental Theorem of Asset Pricing Cherng-tiao Perng Department of Mathematics Norfolk State University
More informationIntroduction to Mathematical Programming IE406. Lecture 3. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 3 Dr. Ted Ralphs IE406 Lecture 3 1 Reading for This Lecture Bertsimas 2.1-2.2 IE406 Lecture 3 2 From Last Time Recall the Two Crude Petroleum example.
More informationIntroduction to Koecher Cones. Michael Orlitzky
Introduction to Koecher Cones Extreme Points Definition 1. Let S be a convex set in some vector space. We say that the point x S is an extreme point of the set S if x = λx 1 + (1 λ)x 2 for λ (0, 1) implies
More informationWeek 3: Faces of convex sets
Week 3: Faces of convex sets Conic Optimisation MATH515 Semester 018 Vera Roshchina School of Mathematics and Statistics, UNSW August 9, 018 Contents 1. Faces of convex sets 1. Minkowski theorem 3 3. Minimal
More informationAn inertial forward-backward method for solving vector optimization problems
An inertial forward-backward method for solving vector optimization problems Sorin-Mihai Grad Chemnitz University of Technology www.tu-chemnitz.de/ gsor research supported by the DFG project GR 3367/4-1
More informationSeparation, Inverse Optimization, and Decomposition. Some Observations. Ted Ralphs 1 Joint work with: Aykut Bulut 1
: Some Observations Ted Ralphs 1 Joint work with: Aykut Bulut 1 1 COR@L Lab, Department of Industrial and Systems Engineering, Lehigh University COLGEN 2016, Buzios, Brazil, 25 May 2016 What Is This Talk
More informationJournal of Mathematical Economics. Coherent risk measures in general economic models and price bubbles
Journal of Mathematical Economics ( ) Contents lists available at SciVerse ScienceDirect Journal of Mathematical Economics journal homepage: www.elsevier.com/locate/jmateco Coherent risk measures in general
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans April 5, 2017 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the introductory
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 informationON THE ARITHMETIC-GEOMETRIC MEAN INEQUALITY AND ITS RELATIONSHIP TO LINEAR PROGRAMMING, BAHMAN KALANTARI
ON THE ARITHMETIC-GEOMETRIC MEAN INEQUALITY AND ITS RELATIONSHIP TO LINEAR PROGRAMMING, MATRIX SCALING, AND GORDAN'S THEOREM BAHMAN KALANTARI Abstract. It is a classical inequality that the minimum of
More informationMidterm Review. Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A.
Midterm Review Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/ yyye (LY, Chapter 1-4, Appendices) 1 Separating hyperplane
More informationarxiv:math/ v1 [math.ac] 11 Nov 2005
A note on Rees algebras and the MFMC property arxiv:math/0511307v1 [math.ac] 11 Nov 2005 Isidoro Gitler, Carlos E. Valencia and Rafael H. Villarreal 1 Departamento de Matemáticas Centro de Investigación
More informationKey words. Integer nonlinear programming, Cutting planes, Maximal lattice-free convex sets
ON MAXIMAL S-FREE CONVEX SETS DIEGO A. MORÁN R. AND SANTANU S. DEY Abstract. Let S Z n satisfy the property that conv(s) Z n = S. Then a convex set K is called an S-free convex set if int(k) S =. A maximal
More informationLecture 1. Toric Varieties: Basics
Lecture 1. Toric Varieties: Basics Taras Panov Lomonosov Moscow State University Summer School Current Developments in Geometry Novosibirsk, 27 August1 September 2018 Taras Panov (Moscow University) Lecture
More informationA New Fenchel Dual Problem in Vector Optimization
A New Fenchel Dual Problem in Vector Optimization Radu Ioan Boţ Anca Dumitru Gert Wanka Abstract We introduce a new Fenchel dual for vector optimization problems inspired by the form of the Fenchel dual
More informationInteger Programming, Part 1
Integer Programming, Part 1 Rudi Pendavingh Technische Universiteit Eindhoven May 18, 2016 Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, 2016 1 / 37 Linear Inequalities and Polyhedra Farkas
More informationConvex Optimization & Machine Learning. Introduction to Optimization
Convex Optimization & Machine Learning Introduction to Optimization mcuturi@i.kyoto-u.ac.jp CO&ML 1 Why do we need optimization in machine learning We want to find the best possible decision w.r.t. a problem
More informationSpring 2017 CO 250 Course Notes TABLE OF CONTENTS. richardwu.ca. CO 250 Course Notes. Introduction to Optimization
Spring 2017 CO 250 Course Notes TABLE OF CONTENTS richardwu.ca CO 250 Course Notes Introduction to Optimization Kanstantsin Pashkovich Spring 2017 University of Waterloo Last Revision: March 4, 2018 Table
More informationAffine Geometry and the Discrete Legendre Transfrom
Affine Geometry and the Discrete Legendre Transfrom Andrey Novoseltsev Department of Mathematics University of Washington April 25, 2008 Andrey Novoseltsev (UW) Affine Geometry April 25, 2008 1 / 24 Outline
More informationInteger Programming ISE 418. Lecture 13. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 13 Dr. Ted Ralphs ISE 418 Lecture 13 1 Reading for This Lecture Nemhauser and Wolsey Sections II.1.1-II.1.3, II.1.6 Wolsey Chapter 8 CCZ Chapters 5 and 6 Valid Inequalities
More informationLecture 8. Strong Duality Results. September 22, 2008
Strong Duality Results September 22, 2008 Outline Lecture 8 Slater Condition and its Variations Convex Objective with Linear Inequality Constraints Quadratic Objective over Quadratic Constraints Representation
More informationTHE MIXING SET WITH FLOWS
THE MIXING SET WITH FLOWS MICHELE CONFORTI, MARCO DI SUMMA, AND LAURENCE A. WOLSEY Abstract. We consider the mixing set with flows: s + x t b t, x t y t for 1 t n; s R 1 +, x Rn +, y Zn +. It models a
More informationEssential Supremum and Essential Maximum with Respect to Random Preference Relations
Essential Supremum and Essential Maximum with Respect to Random Preference Relations Yuri KABANOV a, Emmanuel LEPINETTE b a University of Franche Comté, Laboratoire de Mathématiques, 16 Route de Gray,
More informationA Lower Bound on the Split Rank of Intersection Cuts
A Lower Bound on the Split Rank of Intersection Cuts Santanu S. Dey H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology. 200 Outline Introduction: split rank,
More informationarxiv: v1 [cs.cg] 3 Dec 2014
Combinatorial Redundancy Detection Komei Fukuda 1, Bernd Gärtner 2, and May Szedlák 3 1 Department of Mathematics and Institute of Theoretical Computer Science ETH Zürich, CH-8092 Zürich, Switzerland komeifukuda@mathethzch
More informationPART 4 INTEGER PROGRAMMING
PART 4 INTEGER PROGRAMMING 102 Read Chapters 11 and 12 in textbook 103 A capital budgeting problem We want to invest $19 000 Four investment opportunities which cannot be split (take it or leave it) 1.
More informationInteger Programming ISE 418. Lecture 12. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 12 Dr. Ted Ralphs ISE 418 Lecture 12 1 Reading for This Lecture Nemhauser and Wolsey Sections II.2.1 Wolsey Chapter 9 ISE 418 Lecture 12 2 Generating Stronger Valid
More informationSparse PCA with applications in finance
Sparse PCA with applications in finance A. d Aspremont, L. El Ghaoui, M. Jordan, G. Lanckriet ORFE, Princeton University & EECS, U.C. Berkeley Available online at www.princeton.edu/~aspremon 1 Introduction
More informationValid Inequalities and Restrictions for Stochastic Programming Problems with First Order Stochastic Dominance Constraints
Valid Inequalities and Restrictions for Stochastic Programming Problems with First Order Stochastic Dominance Constraints Nilay Noyan Andrzej Ruszczyński March 21, 2006 Abstract Stochastic dominance relations
More informationValuation and Pricing of Electricity Delivery Contracts The Producer s View
SWM ORCOS Valuation and Pricing of Electricity Delivery Contracts The Producer s View Raimund M. Kovacevic Research Report 2015-04 February, 2015 Operations Research and Control Systems Institute of Statistics
More informationOptimal investment and contingent claim valuation in illiquid markets
and contingent claim valuation in illiquid markets Teemu Pennanen Department of Mathematics, King s College London 1 / 27 Illiquidity The cost of a market orders depends nonlinearly on the traded amount.
More informationSeparation, Inverse Optimization, and Decomposition. Some Observations. Ted Ralphs 1 Joint work with: Aykut Bulut 1
: Some Observations Ted Ralphs 1 Joint work with: Aykut Bulut 1 1 COR@L Lab, Department of Industrial and Systems Engineering, Lehigh University MOA 2016, Beijing, China, 27 June 2016 What Is This Talk
More informationSome Properties of Convex Hulls of Integer Points Contained in General Convex Sets
Some Properties of Convex Hulls of Integer Points Contained in General Convex Sets Santanu S. Dey and Diego A. Morán R. H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute
More informationShiqian Ma, MAT-258A: Numerical Optimization 1. Chapter 4. Subgradient
Shiqian Ma, MAT-258A: Numerical Optimization 1 Chapter 4 Subgradient Shiqian Ma, MAT-258A: Numerical Optimization 2 4.1. Subgradients definition subgradient calculus duality and optimality conditions Shiqian
More informationLecture 7 Monotonicity. September 21, 2008
Lecture 7 Monotonicity September 21, 2008 Outline Introduce several monotonicity properties of vector functions Are satisfied immediately by gradient maps of convex functions In a sense, role of monotonicity
More informationAffine Geometry and Discrete Legendre Transform
Affine Geometry and Discrete Legendre Transform Andrey Novoseltsev April 24, 2008 Abstract The combinatorial duality used in Gross-Siebert approach to mirror symmetry is the discrete Legendre transform
More information8. Geometric problems
8. Geometric problems Convex Optimization Boyd & Vandenberghe extremal volume ellipsoids centering classification placement and facility location 8 Minimum volume ellipsoid around a set Löwner-John ellipsoid
More informationLecture 9 Monotone VIs/CPs Properties of cones and some existence results. October 6, 2008
Lecture 9 Monotone VIs/CPs Properties of cones and some existence results October 6, 2008 Outline Properties of cones Existence results for monotone CPs/VIs Polyhedrality of solution sets Game theory:
More informationIE 521 Convex Optimization
Lecture 1: 16th January 2019 Outline 1 / 20 Which set is different from others? Figure: Four sets 2 / 20 Which set is different from others? Figure: Four sets 3 / 20 Interior, Closure, Boundary Definition.
More informationWorkshop on Nonlinear Optimization
Workshop on Nonlinear Optimization 5-6 June 2015 The aim of the Workshop is to bring optimization experts in vector optimization and nonlinear optimization together to exchange their recent research findings
More informationLecture 5. The Dual Cone and Dual Problem
IE 8534 1 Lecture 5. The Dual Cone and Dual Problem IE 8534 2 For a convex cone K, its dual cone is defined as K = {y x, y 0, x K}. The inner-product can be replaced by x T y if the coordinates of the
More informationIE 5531: Engineering Optimization I
IE 5531: Engineering Optimization I Lecture 3: Linear Programming, Continued Prof. John Gunnar Carlsson September 15, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I September 15, 2010
More informationCHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS. W. Erwin Diewert January 31, 2008.
1 ECONOMICS 594: LECTURE NOTES CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS W. Erwin Diewert January 31, 2008. 1. Introduction Many economic problems have the following structure: (i) a linear function
More informationOn duality gap in linear conic problems
On duality gap in linear conic problems C. Zălinescu Abstract In their paper Duality of linear conic problems A. Shapiro and A. Nemirovski considered two possible properties (A) and (B) for dual linear
More informationConvex Optimization M2
Convex Optimization M2 Lecture 3 A. d Aspremont. Convex Optimization M2. 1/49 Duality A. d Aspremont. Convex Optimization M2. 2/49 DMs DM par email: dm.daspremont@gmail.com A. d Aspremont. Convex Optimization
More informationLinear and Integer Optimization (V3C1/F4C1)
Linear and Integer Optimization (V3C1/F4C1) Lecture notes Ulrich Brenner Research Institute for Discrete Mathematics, University of Bonn Winter term 2016/2017 March 8, 2017 12:02 1 Preface Continuous updates
More informationA notion of Total Dual Integrality for Convex, Semidefinite and Extended Formulations
A notion of for Convex, Semidefinite and Extended Formulations Marcel de Carli Silva Levent Tunçel April 26, 2018 A vector in R n is integral if each of its components is an integer, A vector in R n is
More informationCOURSE ON LMI PART I.2 GEOMETRY OF LMI SETS. Didier HENRION henrion
COURSE ON LMI PART I.2 GEOMETRY OF LMI SETS Didier HENRION www.laas.fr/ henrion October 2006 Geometry of LMI sets Given symmetric matrices F i we want to characterize the shape in R n of the LMI set F
More informationEXTENSIONS OF CONVEX FUNCTIONALS ON CONVEX CONES
APPLICATIONES MATHEMATICAE 25,3 (1998), pp. 381 386 E. IGNACZAK (Szczecin) A. PASZKIEWICZ ( Lódź) EXTENSIONS OF CONVEX FUNCTIONALS ON CONVEX CONES Abstract. We prove that under some topological assumptions
More informationUsing Economic Contexts to Advance in Mathematics
Using Economic Contexts to Advance in Mathematics Erik Balder University of Utrecht, Netherlands DEE 2013 presentation, Exeter Erik Balder (Mathematical Institute, University of Utrecht)using economic
More informationMotivating examples Introduction to algorithms Simplex algorithm. On a particular example General algorithm. Duality An application to game theory
Instructor: Shengyu Zhang 1 LP Motivating examples Introduction to algorithms Simplex algorithm On a particular example General algorithm Duality An application to game theory 2 Example 1: profit maximization
More informationCSCI 1951-G Optimization Methods in Finance Part 01: Linear Programming
CSCI 1951-G Optimization Methods in Finance Part 01: Linear Programming January 26, 2018 1 / 38 Liability/asset cash-flow matching problem Recall the formulation of the problem: max w c 1 + p 1 e 1 = 150
More informationLift-and-Project Inequalities
Lift-and-Project Inequalities Q. Louveaux Abstract The lift-and-project technique is a systematic way to generate valid inequalities for a mixed binary program. The technique is interesting both on the
More informationApplied Lagrange Duality for Constrained Optimization
Applied Lagrange Duality for Constrained Optimization February 12, 2002 Overview The Practical Importance of Duality ffl Review of Convexity ffl A Separating Hyperplane Theorem ffl Definition of the Dual
More information