Easy and not so easy multifacility location problems... (In 20 minutes.)
|
|
- Christopher Powell
- 5 years ago
- Views:
Transcription
1 Easy and not so easy multifacility location problems... (In 20 minutes.) MINLP 2014 Pittsburgh, June 2014 Justo Puerto Institute of Mathematics (IMUS) Universidad de Sevilla
2 Outline 1 Introduction (In 3 minutes) 2 Discrete ordered median problem (in 7 minutes) 3 Continuous multifacility problems (10 minutes) 4 Dimensionality reduction of the SDP-rel for multifacility location problems (in no time) Mutifacility Location Problems MINLP
3 A few minutes of motivation Mutifacility Location Problems MINLP
4 A few minutes of motivation Logistic problem or in another jargon Clustering or Classification Problem Mutifacility Location Problems MINLP
5 A few minutes of motivation Logistic problem or in another jargon Clustering or Classification Problem Mutifacility Location Problems MINLP
6 Discrete ordered median problem: Modeling framework Mutifacility Location Problems MINLP
7 Discrete ordered median problem: Modeling framework r 1 r 2 r 3 r 4 r 5 λ 1r 1 + λ 2r 2 + λ 3r 3 + λ 4r 4 + λ 5r 5 Mutifacility Location Problems MINLP
8 Ordered Median Functions Definition Let x R n and λ R n. The ordered median function, f λ is defined as: f λ (x) = λ, sort(x) where sort(x) = (x (1),..., x (n) ) with x (i) {x 1,..., x n} and such that x (1) x (2) x (n). Mutifacility Location Problems MINLP
9 Special Cases Mean ( 1 n,, 1 n ) 1 n Minimum (1, 0,, 0) min i 1 i n Maximum (0, 0,, 1) max i 1 i n {}}{ k-centrum (0,, 0, 1,, 1) {}}{ anti-k-centrum ( 1,, 1, 0,, 0) {}}{{}}{ (k 1, k 2)-Trimmed mean ( 0,, 0, 1,, 1, 0,, 0) k 1 k k k 2 i=n k+1 k n k 2 i=k 1 +1 Range ( 1, 0,, 0, 1) max i min 1 i n x i x (i) x (i) x (i) 1 i n x i Mutifacility Location Problems MINLP
10 Our program starts about Mutifacility Location Problems MINLP
11 Previous Works Discrete Case: (Nickel & P., 2005; Boland, Marin, Nickel, P., 2006; Marín, Nickel, P., 2009). Networks: ( Nickel & P., 1999; Kalcsics, Nickel, P., 2002; Kalcsics, Nickel, P., Tamir, 2006; P. & Tamir, 2005); Continuous: Planar Weber Problem: (Weiszfeld, 1937; and extensions...) Planar Euclidean: BTST (Drezner, 2007); D.C. (Drezner& Nickel, 2009). Planar Convex OM with l p norms: (Espejo, et. al, 2009). Planar Euclidean k-centrum: (Rodríguez-Chía et. al, 2010). OM 1-Facility Location, any dimension, any l p or polyhedral norm: (Blanco, P. & ElHaj-BenAli, 2013, 2014). Mutifacility Location Problems MINLP
12 7 minutes for the DOMP: An INLP A = {a 1,..., a n} C = (c ij ) i,j=1,...,n X A with X = p p c i (X ) := min k X c ik σ X a permutation of {1,..., n} c σx (1)(X ) c σx (2)(X ) c σx (n)(x ) Discrete ordered median problem (DOpP) min X A, X =p λ i c σx (i)(x ). with λ = (λ 1,..., λ n) y λ i 0, i = 1,..., n. Mutifacility Location Problems MINLP
13 Sorting as an integer program (IP) INPUT: real numbers r 1,..., r n. OUTPUT: r σ(1) r σ(2)... r σ(n), σ Π({1,..., n}). Decision variables: s ki = { 1 if σ(k) = i 0 otherwise i, k = 1,..., n. Mutifacility Location Problems MINLP
14 r σ(k) := s ki r i, k = 1,..., n Desired output obtained Sorting as an IP: (SORT) minimize 1 s.t. s ki = 1 k=1 s ki = 1 s ki r i i = 1,..., n k = 1,..., n s k+1,i r i k= 1,..., n 1 s ki {0, 1} i, k = 1,..., n. Mutifacility Location Problems MINLP
15 p-median formulation Decision variables: { 1 a new facility is built in aj y j = 0 otherwise { 1 site ai is served by facility a j and x ij = 0 otherwise minimize c ij x ij j=1 y j = p j=1 x ij = 1 j=1 y j x ij i = 1,..., n j, i = 1,..., n y j {0, 1}, x ij 0 j, i = 1,..., n Mutifacility Location Problems MINLP
16 Quadratic formulation for DOMP: Constraints to sort Setting r i = minimize c ij x ij, i = 1,..., n. (SORT+ p-median) (DOMP) j=1 n k=1 λ k s ki n s n ki j=1 c ijx ij s ki = 1 k=1 s ki = 1 c ij x ij j=1 s k+1,i i = 1,..., n k = 1,..., n c ij x ij k = 1,..., n 1 j=1 Mutifacility Location Problems MINLP
17 Quadratic formulation for DOMP: Constraints to sort Constraints corresponding to p-median problem y j = p j=1 x ij = 1 j=1 y j x ij x ij 0 s ki {0, 1} y j {0, 1} i = 1,..., n j, i = 1,..., n j, i = 1,..., n i, k = 1,..., n j = 1,..., n Mutifacility Location Problems MINLP
18 A first linearization: DOMP1 Constraints to sort. Adding artificial variables x k (L1) minimize n k=1 λ k n n j=1 c ij s ki x ij }{{} x k ij ij j=1 k=1 s ki }{{} j xk ij = 1 k = 1,..., n s ki = 1 k = 1,..., n }{{} j xk ij c ij s ki x ij k = 1,..., n 1 }{{} x k ij j=1 c ij s k+1,i x ij }{{} x k+1 ij Mutifacility Location Problems MINLP
19 Linearization Constraints corresponding to p-median problem y j = p j ( ) x ij = 1 i = 1,..., n }{{} j k xk ij y j x ij j, i = 1,..., n }{{} k xk ij xij k {0, 1} y j {0, 1} i, k, j = 1,..., n j = 1,..., n Mutifacility Location Problems MINLP
20 A new formulation for DOMP: DOMP3 Example j=1 c ij x k ij j=1 c ij x k+1 ij k = 1,..., n C = Mutifacility Location Problems MINLP
21 A new formulation for DOMP: DOMP3 Example j=1 c ij x k ij j=1 c ij x k+1 ij k = 1,..., n C = x k ij = y j = 1 if facility i allocated to server j and C ij is the k-th smallest cost 0 otherwise { 1 if j J 0 if j / J Mutifacility Location Problems MINLP
22 The rationale: Incompatibilities k k 1 Mutifacility Location Problems MINLP
23 The rationale: Incompatibilities k k 1 k k 1 Mutifacility Location Problems MINLP
24 DOMP 3 min s.t. îĵ ij j=1 k=1 j=1 k=1 k=1 x k 1 îĵ j=1 λ k C ij x k ij x k ij = 1 x k ij = 1 x k ij y j y j = p j=1 + îĵ ij x k ij {0, 1} x k îĵ 1 i = 1,..., n k = 2,..., n i, j = 1,..., n i, j = 1,, n k = 2,, n i, j, k = 1,..., n Mutifacility Location Problems MINLP
25 DOMP 4 Formulation min j=1 k=1 λ k C ij x k ij s.t. j=1 k=1 x k ij = 1 i = 1,..., n j=1 x k ij = 1 k = 2,..., n x k ij y j k=1 y j = p j=1 i, j = 1,..., n i x k i j + j i =1 :i j j =1 ij i =1 :i j x k 1 j i j n2 =1 ij k = 2,, n x k ij {0, 1} i, j, k = 1,..., n Mutifacility Location Problems MINLP
26 Comparing formulations Notation We denote by P l the polytope defining the feasible set of the linear relaxation of formulation DOMP l, by z l ( ) the value of the objective function of DOMP l evaluated at the point ( ) and by Pl I the convex hull of the integer solutions within that polytope. Theorem 1 g(p 2) P 1. 2 f (P 3) P 2. 3 P 3 P 1. 4 z LP 3 z LP 2 z LP 1. Mutifacility Location Problems MINLP
27 Formulation GAP DOMP % DOMP % DOMP % DOMP % DOMP % Table: Average integrality gaps Mutifacility Location Problems MINLP
28 Formulation GAP DOMP % DOMP % DOMP % DOMP % DOMP % Table: Average integrality gaps Solution approach Time (s) #nodes DOMP 3(B&B) (8) DOMP 4 1(B&B) DOMP 4 1(B&C 3) DOMP 4(B&C 3) Table: CPU-Time and Number of nodes of the different formulations for n = 20, 30, 50. Mutifacility Location Problems MINLP
29 Continuous Multifacility Ordered Median Problems in 10 minutes Demand points : A = {a 1,..., a n } R d ( d ) 1 τ Norm : l τ ( x τ = x i τ, for all x R d ) Feasible Domain : R d Facilities : p facilities to be located. Goal : Find p points x1,..., xp R d minimizing some globalizing function of the distances to the set A. Mutifacility Location Problems MINLP
30 An easy model: Multiple allocation MF OMP Rodríguez-Chía, Nickel, P., and Fernández. (2000) Mutifacility Location Problems MINLP
31 Multiple allocation MF OMP where, µ jj 0. f NI λ (x 1, x 2,..., x p) = p j=1 p 1 λ ij d (i) (x j ) + X = {x 1,..., x p}, d i (x) = a i x τ, p j=1 j =j+1 d (1) (x) d (2) (x)... d (n) (x), λ 11 λ λ n1 0, λ 12 λ λ n2 0,... λ 1p λ 2p... λ np 0, µ jj x j x j τ, (1) Mutifacility Location Problems MINLP
32 Multiple allocation MF OMP where, µ jj 0. f NI λ (x 1, x 2,..., x p) = p j=1 p 1 λ ij d (i) (x j ) + X = {x 1,..., x p}, d i (x) = a i x τ, p j=1 j =j+1 d (1) (x) d (2) (x)... d (n) (x), λ 11 λ λ n1 0, λ 12 λ λ n2 0,... λ 1p λ 2p... λ np 0, µ jj x j x j τ, (1) ρ NI λ := min{fλ NI (x x 1,..., x p) : x j R d, j = 1,..., p}, (LOCOMF NI) Mutifacility Location Problems MINLP
33 Decision variables v ij and w lj continuous variables modelling the ordered weighted average in the o.f., x j = coordinates in R d of the j-th facility, y ijk = absolute value of the k-th coordinate of the vector x j a i, u ij = x j a i τ τ. z jj k = absolute value of the k-th coordinate of the vector x j x j, t jj = x j x j τ τ. Mutifacility Location Problems MINLP
34 Multiple allocation MF OMP Theorem Let τ = r s be such that r, s N \ {0}, r s and gcd(r, s) = 1. For any set of lambda weights satisfying λ 1j... λ nj 0 for all j = 1,..., p, Problem (LOCOMF NI) is equivalent to p p ρ NI λ = min p 1 p v ij + w lj + t jj (2) j=1 l=1 j=1 j=1 j =j+1 s.t v ij + w lj λ lj u ij, i, l = 1,..., n, j = 1,..., p y ijk x jk + a ik 0, i = 1,..., n, j = 1,..., p, k = 1,..., d y ijk + x jk a ik 0, i = 1,..., n, j = 1,..., p, k = 1,..., d, y r ijk ςs ijk ur s ij, i = 1,..., n, j = 1,..., p, k = 1,..., d, r ω s i d ς ijk u ij, k=1 i = 1,..., n, j = 1,..., p z jj k x jk + x j k 0, j, j = 1,..., p, k = 1,..., d, z jj k + x jk x j k 0, j, j = 1,..., p, k = 1,..., d, z r jj k ξs jj k tr s jj, j, j = 1,..., p, k = 1,..., d, r µ s jj d ξ jj k t jj, j, j = 1,..., p, k=1 ς ijk 0, i = 1,..., n, j = 1,..., p, k = 1,..., d, ξ jj k 0 j, j = 1,..., p, k = 1,..., d. Mutifacility Location Problems MINLP
35 Multiple allocation MF OMP Theorem Let τ = r s be such that r, s N \ {0}, r s and gcd(r, s) = 1. For any set of lambda weights satisfying λ 1j... λ nj 0 for all j = 1,..., p, Problem (LOCOMF NI) is equivalent to p p ρ NI λ = min p 1 p v ij + w lj + t jj (2) j=1 l=1 j=1 j=1 j =j+1 s.t v ij + w lj λ lj u ij, i, l = 1,..., n, j = 1,..., p y ijk x jk + a ik 0, i = 1,..., n, j = 1,..., p, k = 1,..., d y ijk + x jk a ik 0, i = 1,..., n, j = 1,..., p, k = 1,..., d, y r ijk ςs ijk ur s ij, i = 1,..., n, j = 1,..., p, k = 1,..., d, r ω s i d ς ijk u ij, k=1 i = 1,..., n, j = 1,..., p z jj k x jk + x j k 0, j, j = 1,..., p, k = 1,..., d, z jj k + x jk x j k 0, j, j = 1,..., p, k = 1,..., d, z r jj k ξs jj k tr s jj, j, j = 1,..., p, k = 1,..., d, r µ s jj d ξ jj k t jj, j, j = 1,..., p, k=1 ς ijk 0, i = 1,..., n, j = 1,..., p, k = 1,..., d, ξ jj k 0 j, j = 1,..., p, k = 1,..., d. Mutifacility Location Problems MINLP
36 Multiple allocation MF OMP Theorem Let τ = r s be such that r, s N \ {0}, r s and gcd(r, s) = 1. For any set of lambda weights satisfying λ 1j... λ nj 0 for all j = 1,..., p, Problem (LOCOMF NI) is equivalent to p p ρ NI λ = min p 1 p v ij + w lj + t jj (2) j=1 l=1 j=1 j=1 j =j+1 s.t v ij + w lj λ lj u ij, i, l = 1,..., n, j = 1,..., p y ijk x jk + a ik 0, i = 1,..., n, j = 1,..., p, k = 1,..., d y ijk + x jk a ik 0, i = 1,..., n, j = 1,..., p, k = 1,..., d, y r ijk ςs ijk ur s ij, i = 1,..., n, j = 1,..., p, k = 1,..., d, r ω s i d ς ijk u ij, k=1 i = 1,..., n, j = 1,..., p z jj k x jk + x j k 0, j, j = 1,..., p, k = 1,..., d, z jj k + x jk x j k 0, j, j = 1,..., p, k = 1,..., d, z r jj k ξs jj k tr s jj, j, j = 1,..., p, k = 1,..., d, r µ s jj d ξ jj k t jj, j, j = 1,..., p, k=1 ς ijk 0, i = 1,..., n, j = 1,..., p, k = 1,..., d, ξ jj k 0 j, j = 1,..., p, k = 1,..., d. Mutifacility Location Problems MINLP
37 Sorting with permutations: λ 1... λ n p j=1 λ ij u (i)j = max σ P n p λ ij u σ(i)j. The permutations in P n can be represented by the binary variables s ijk {0, 1} Next, combining the two sets of variables the objective function is: p p λ ij u (i)j = max λ ij u ij s ijk j=1 s.t j=1 k=1 j=1 s ijk = 1, j = 1,..., p, k = 1,..., n, s ijk = 1, i = 1,..., n, j = 1,..., p, k=1 s ijk {0, 1}. (3) Mutifacility Location Problems MINLP
38 Sorting with a linear program For fixed j {1,..., p} and for any vector u j R n, by using the dual of the assignment problem (7) we obtain the following expression λ ij u (i)j = min v ij + w lj (4) l=1 s.t v ij + w lj λ lj u ij, i, l = 1,..., n. Finally, we replace (4) for the objective function and we get min p v ij + j=1 l=1 p j=1 p 1 w lj + p j=1 j =j+1 s.t v ij + w lj λ lj u ij, i, l = 1,..., n, j = 1,..., p, u ij ω i x j a i τ, i = 1,..., n, j = 1,..., p, t jj µ jj x j x j τ, j, j = 1,..., p. t jj (5) Mutifacility Location Problems MINLP
39 Second Order Cone Constraints Lemma (Blanco, P., ElHaj-BenAli, 2014) Let τ = r s be such that r, s N \ {0}, r > s, gcd(r, s) = 1 and k = log 2 (r) 1. Let x, u and t be non negative and satisfying x r u s t r s. (6) Then, there exists w such that, (6) is equivalent to: w 2 1 A 1B 1,.. w 2 m A mb m, x 2 A m+1b m+1, (7) where A i, B i {w i 1, u, t, x} for i = 1,..., m and m = 1 + 2#{i : α i + β i + γ i 2, 1 i < k 1} + #{i : α i + β i + γ i 1, 1 i < k 1} O(log(r)) with: α i, β i, γ i {0, 1}. s = α k 1 2 k 1 + α k 2 2 k α α 02 0, r s = β k 1 2 k 1 + β k 2 2 k β β 02 0, 2 k r = γ k 1 2 k 1 + γ k 2 2 k γ γ 02 0, 2 k = (α k 1 + β k 1 + γ k 1 )2 k (α 0 + β 0 + γ 0)2 0, Mutifacility Location Problems MINLP
40 Corollary (sequel) Moreover, Problem (2) satisfies Slater condition and it can be represented as a second order cone (or semidefinite) program with (np + p 2 )(2d + 1) + p 2 linear inequalities and at most 4(p 2 d + npd) log r second order cone (or linear matrix) inequalities. Remark As consequence of the previous theorem, problem (2) is convex and can be solved, up to any given accuracy, in polynomial time for any dimension d. Mutifacility Location Problems MINLP
41 Experiments Coded in: Gurobi 5.6. Intel Core i7 processor; 2x 2.40 GHz; 4 GB of RAM Instance: 50-points data set in Eilon, Watson-Gandy & Christofides (1971) CPU-Times (secs.): τ p Mutifacility Location Problems MINLP
42 The program continues with some extensions... Mutifacility Location Problems MINLP
43 A hard MF problem: Single allocation MF OMP Miehle (1958), Cooper (1963) C. Pey-Chun, P. Hansen, B. Jaumard and T. Hoang (1998) Mutifacility Location Problems MINLP
44 Single allocation MF OMP Assume that: f i (x) : R pd R x = (x 1,..., x p) t i := min j a i τ }. j=1..p K R d. τ := r 1, r, s N with gcd(r, s) = 1. s λ l 0 for all l = 1,..., n. Consider the following problem ρ λ := min x { λ i f(i) (x) : x = (x 1,..., x p), x j K, j = 1,..., p}, (LOCOMF) Mutifacility Location Problems MINLP
45 Single allocation MF OMP ˆρ λ = min λ l θ l l=1 (MFOMP λ ) s.t. h il 1 := t i θ l + UB i (1 w il ), i = 1,..., n, l = 1,..., n, h l 2 := θ l θ l+1, l = 1,..., n 1, h 3 ij := u ij t i + UB i (1 z ij ), i = 1,..., n, j = 1,..., p, hijk 4 := v ijk x jk + a ik 0, i = 1,..., n, j = 1,..., p, k = 1,..., d, h ijk 5 := v ijk + x jk a ik 0, i = 1,..., n, j = 1,..., p, k = 1,.., d, h ijk 6 := vr ijk ζs ijk ur s, i = 1,..., n, j = 1,..., p, k = 1,..., d, ij hij 7 d := ζ ijk u ij, i = 1,..., n, j = 1,..., p, k=1 hi 8 p := z ij = 1, i = 1,..., n, j=1 hl 9 := w il = 1, l = 1,..., n, h 10 i := w il = 1, i = 1,..., n, l=1 w il {0, 1}, i, l = 1,..., n, z ij {0, 1}, i = 1,..., n, j = 1,..., p, θ l, t i, v ijk, ζ ijk, u ij R +, i, l = 1,..., n, j = 1,..., p, k = 1,..., d, x j K, j = 1,..., p. Mutifacility Location Problems MINLP
46 Theorem Let x be a feasible solution of LOCOMF then there exists a solution (x, z, u, v, ζ, w, t, θ) for MFOMP λ such that their objective values are equal. Conversely, if (x, z, u, v, ζ, w, t, θ) is a feasible solution for MFOMP λ then x is a feasible solution for LOCOMF. Furthermore, if K satisfies Slater condition then the feasible region of the continuous relaxation of MFOMP λ also satisfies Slater condition and ρ λ = ˆρ λ. Mutifacility Location Problems MINLP
47 Experiments Problem p τ CPU Time f Problem p τ CPU Time f Problem p τ CPU Time f p-median p-center p-25-centrum Table: Computational results for p-median, p-center and p-25-centrum problems for the 50-points in Eilon, Watson-Gandy & Christofides data set. Mutifacility Location Problems MINLP
48 Constrained MF Ordered Median Problem A SDP relaxation of the LOCOMF Let h 0(θ) := m λ l θ l, and denote ξ j := (deg g j )/2 and ν j := (deg h j )/2, where l=1 {g 1,..., g nk }, and {h 1,..., h nc1} are, respectively, the polynomial constraints that define K and ˆK \ K in MFOMP λ. For r r 0 := max{ max ξ k, max ν j}, introduce the k=1,...,n K j=0,...,nc1 hierarchy of semidefinite programs: min y L y(p λ ) s.t. M r (y) 0, M r ξk (g k, y) 0, k = 1,..., n K, M r νj (h j, y) 0, j = 1,..., nc1, y 0 = 1, (Q1 r ) Mutifacility Location Problems MINLP
49 Theorem Let ˆK R nv 1 (compact) be the feasible domain of Problem MFOMP λ. Let inf Q1 r be the optimal value of the semidefinite program Q1 r. Then, with the notation above: (a) inf Q1 r ρ λ as r. (b) Let y r be an optimal solution of the SDP relaxation Q1 r. If rank M r (y r ) = rank M r r0 (y r ) = ϕ then min Q1 r = ρ λ and one may extract ϕ points (x 1 (k),..., x p (k), z (k), u (k), v (k), ζ (k), w (k), t (k), θ (k)) ϕ k=1 ˆK, all global minimizers of the MFOMP λ problem. Mutifacility Location Problems MINLP
50 The size of SDP relaxations grows rapidly with the original problem size. In view of the present status of SDP-solvers, only small to medium size problems can be solved. We found in our model patterns to exploit: Sparsity. Symmetry. Mutifacility Location Problems MINLP
51 Thank you! Mutifacility Location Problems MINLP
EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 18
EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 18 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory May 31, 2012 Andre Tkacenko
More informationCutting Planes for First Level RLT Relaxations of Mixed 0-1 Programs
Cutting Planes for First Level RLT Relaxations of Mixed 0-1 Programs 1 Cambridge, July 2013 1 Joint work with Franklin Djeumou Fomeni and Adam N. Letchford Outline 1. Introduction 2. Literature Review
More informationSeparation Techniques for Constrained Nonlinear 0 1 Programming
Separation Techniques for Constrained Nonlinear 0 1 Programming Christoph Buchheim Computer Science Department, University of Cologne and DEIS, University of Bologna MIP 2008, Columbia University, New
More informationThe Graph Realization Problem
The Graph Realization Problem via Semi-Definite Programming A. Y. Alfakih alfakih@uwindsor.ca Mathematics and Statistics University of Windsor The Graph Realization Problem p.1/21 The Graph Realization
More informationConvex Optimization & Parsimony of L p-balls representation
Convex Optimization & Parsimony of L p -balls representation LAAS-CNRS and Institute of Mathematics, Toulouse, France IMA, January 2016 Motivation Unit balls associated with nonnegative homogeneous polynomials
More informationDisconnecting Networks via Node Deletions
1 / 27 Disconnecting Networks via Node Deletions Exact Interdiction Models and Algorithms Siqian Shen 1 J. Cole Smith 2 R. Goli 2 1 IOE, University of Michigan 2 ISE, University of Florida 2012 INFORMS
More informationOrdered median problem with demand distribution weights
Optim Lett (2016) 10:1071 1086 DOI 10.1007/s11590-015-0990-4 ORIGINAL PAPER Ordered median problem with demand distribution weights Włodzimierz Ogryczak 1 Paweł Olender 2 Received: 30 March 2015 / Accepted:
More informationCSCI 1951-G Optimization Methods in Finance Part 10: Conic Optimization
CSCI 1951-G Optimization Methods in Finance Part 10: Conic Optimization April 6, 2018 1 / 34 This material is covered in the textbook, Chapters 9 and 10. Some of the materials are taken from it. Some of
More informationThe moment-lp and moment-sos approaches
The moment-lp and moment-sos approaches LAAS-CNRS and Institute of Mathematics, Toulouse, France CIRM, November 2013 Semidefinite Programming Why polynomial optimization? LP- and SDP- CERTIFICATES of POSITIVITY
More informationA Compact Linearisation of Euclidean Single Allocation Hub Location Problems
A Compact Linearisation of Euclidean Single Allocation Hub Location Problems J. Fabian Meier 1,2, Uwe Clausen 1 Institute of Transport Logistics, TU Dortmund, Germany Borzou Rostami 1, Christoph Buchheim
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 informationConvex Geometry. Carsten Schütt
Convex Geometry Carsten Schütt November 25, 2006 2 Contents 0.1 Convex sets... 4 0.2 Separation.... 9 0.3 Extreme points..... 15 0.4 Blaschke selection principle... 18 0.5 Polytopes and polyhedra.... 23
More informationSemidefinite Programming Basics and Applications
Semidefinite Programming Basics and Applications Ray Pörn, principal lecturer Åbo Akademi University Novia University of Applied Sciences Content What is semidefinite programming (SDP)? How to represent
More informationPartitioning Algorithms that Combine Spectral and Flow Methods
CS369M: Algorithms for Modern Massive Data Set Analysis Lecture 15-11/11/2009 Partitioning Algorithms that Combine Spectral and Flow Methods Lecturer: Michael Mahoney Scribes: Kshipra Bhawalkar and Deyan
More informationPolyhedral Results for A Class of Cardinality Constrained Submodular Minimization Problems
Polyhedral Results for A Class of Cardinality Constrained Submodular Minimization Problems Shabbir Ahmed and Jiajin Yu Georgia Institute of Technology A Motivating Problem [n]: Set of candidate investment
More informationInteger Programming, Constraint Programming, and their Combination
Integer Programming, Constraint Programming, and their Combination Alexander Bockmayr Freie Universität Berlin & DFG Research Center Matheon Eindhoven, 27 January 2006 Discrete Optimization General framework
More informationNew Exact Approaches to Row Layout Problems
New Exact Approaches to Row Layout Problems Anja Fischer, Frank Fischer, Philipp Hungerländer November 3, 015 Abstract. Given a set of departments, a number of rows and pairwise connectivities between
More informationA Benders Algorithm for Two-Stage Stochastic Optimization Problems With Mixed Integer Recourse
A Benders Algorithm for Two-Stage Stochastic Optimization Problems With Mixed Integer Recourse Ted Ralphs 1 Joint work with Menal Güzelsoy 2 and Anahita Hassanzadeh 1 1 COR@L Lab, Department of Industrial
More informationWhat can be expressed via Conic Quadratic and Semidefinite Programming?
What can be expressed via Conic Quadratic and Semidefinite Programming? A. Nemirovski Faculty of Industrial Engineering and Management Technion Israel Institute of Technology Abstract Tremendous recent
More informationScenario Grouping and Decomposition Algorithms for Chance-constrained Programs
Scenario Grouping and Decomposition Algorithms for Chance-constrained Programs Siqian Shen Dept. of Industrial and Operations Engineering University of Michigan Joint work with Yan Deng (UMich, Google)
More informationarxiv: v1 [math.oc] 28 Jul 2017
Mathematical Programg formulations for the efficient solution of the k-sum approval voting problem Diego Ponce 1, Justo Puerto 1, Federica Ricca 2, Andrea Scozzari 3 arxiv:1707.09225v1 [math.oc] 28 Jul
More informationApproximation algorithms for nonnegative polynomial optimization problems over unit spheres
Front. Math. China 2017, 12(6): 1409 1426 https://doi.org/10.1007/s11464-017-0644-1 Approximation algorithms for nonnegative polynomial optimization problems over unit spheres Xinzhen ZHANG 1, Guanglu
More informationSequential pairing of mixed integer inequalities
Sequential pairing of mixed integer inequalities Yongpei Guan, Shabbir Ahmed, George L. Nemhauser School of Industrial & Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta,
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 informationRLT-POS: Reformulation-Linearization Technique (RLT)-based Optimization Software for Polynomial Programming Problems
RLT-POS: Reformulation-Linearization Technique (RLT)-based Optimization Software for Polynomial Programming Problems E. Dalkiran 1 H.D. Sherali 2 1 The Department of Industrial and Systems Engineering,
More informationConvex Optimization M2
Convex Optimization M2 Lecture 8 A. d Aspremont. Convex Optimization M2. 1/57 Applications A. d Aspremont. Convex Optimization M2. 2/57 Outline Geometrical problems Approximation problems Combinatorial
More informationIndicator Constraints in Mixed-Integer Programming
Indicator Constraints in Mixed-Integer Programming Andrea Lodi University of Bologna, Italy - andrea.lodi@unibo.it Amaya Nogales-Gómez, Universidad de Sevilla, Spain Pietro Belotti, FICO, UK Matteo Fischetti,
More informationA Hierarchy of Polyhedral Approximations of Robust Semidefinite Programs
A Hierarchy of Polyhedral Approximations of Robust Semidefinite Programs Raphael Louca Eilyan Bitar Abstract Robust semidefinite programs are NP-hard in general In contrast, robust linear programs admit
More informationRevenue Maximization in a Cloud Federation
Revenue Maximization in a Cloud Federation Makhlouf Hadji and Djamal Zeghlache September 14th, 2015 IRT SystemX/ Telecom SudParis Makhlouf Hadji Outline of the presentation 01 Introduction 02 03 04 05
More informationThe Multiple Checkpoint Ordering Problem
The Multiple Checkpoint Ordering Problem Philipp Hungerländer Kerstin Maier November 19, 2017 Abstract The multiple Checkpoint Ordering Problem (mcop) aims to find an optimal arrangement of n one-dimensional
More informationDuality. Lagrange dual problem weak and strong duality optimality conditions perturbation and sensitivity analysis generalized inequalities
Duality Lagrange dual problem weak and strong duality optimality conditions perturbation and sensitivity analysis generalized inequalities Lagrangian Consider the optimization problem in standard form
More informationA Stochastic-Oriented NLP Relaxation for Integer Programming
A Stochastic-Oriented NLP Relaxation for Integer Programming John Birge University of Chicago (With Mihai Anitescu (ANL/U of C), Cosmin Petra (ANL)) Motivation: The control of energy systems, particularly
More informationCSC Linear Programming and Combinatorial Optimization Lecture 12: The Lift and Project Method
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 12: The Lift and Project Method Notes taken by Stefan Mathe April 28, 2007 Summary: Throughout the course, we have seen the importance
More informationarxiv: v15 [math.oc] 19 Oct 2016
LP formulations for mixed-integer polynomial optimization problems Daniel Bienstock and Gonzalo Muñoz, Columbia University, December 2014 arxiv:1501.00288v15 [math.oc] 19 Oct 2016 Abstract We present a
More informationOptimization over Polynomials with Sums of Squares and Moment Matrices
Optimization over Polynomials with Sums of Squares and Moment Matrices Monique Laurent Centrum Wiskunde & Informatica (CWI), Amsterdam and University of Tilburg Positivity, Valuations and Quadratic Forms
More informationLOWER BOUNDS FOR THE UNCAPACITATED FACILITY LOCATION PROBLEM WITH USER PREFERENCES. 1 Introduction
LOWER BOUNDS FOR THE UNCAPACITATED FACILITY LOCATION PROBLEM WITH USER PREFERENCES PIERRE HANSEN, YURI KOCHETOV 2, NENAD MLADENOVIĆ,3 GERAD and Department of Quantitative Methods in Management, HEC Montréal,
More informationBranch-and-Price-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows
Branch-and-Price-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows Guy Desaulniers École Polytechnique de Montréal and GERAD Column Generation 2008 Aussois, France Outline Introduction
More informationMILP reformulation of the multi-echelon stochastic inventory system with uncertain demands
MILP reformulation of the multi-echelon stochastic inventory system with uncertain demands Axel Nyberg Åbo Aademi University Ignacio E. Grossmann Dept. of Chemical Engineering, Carnegie Mellon University,
More informationCSC Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming Notes taken by Mike Jamieson March 28, 2005 Summary: In this lecture, we introduce semidefinite programming
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 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 informationAssignment 1: From the Definition of Convexity to Helley Theorem
Assignment 1: From the Definition of Convexity to Helley Theorem Exercise 1 Mark in the following list the sets which are convex: 1. {x R 2 : x 1 + i 2 x 2 1, i = 1,..., 10} 2. {x R 2 : x 2 1 + 2ix 1x
More informationConvex Optimization on Large-Scale Domains Given by Linear Minimization Oracles
Convex Optimization on Large-Scale Domains Given by Linear Minimization Oracles Arkadi Nemirovski H. Milton Stewart School of Industrial and Systems Engineering Georgia Institute of Technology Joint research
More informationSolving Global Optimization Problems with Sparse Polynomials and Unbounded Semialgebraic Feasible Sets
Solving Global Optimization Problems with Sparse Polynomials and Unbounded Semialgebraic Feasible Sets V. Jeyakumar, S. Kim, G. M. Lee and G. Li June 6, 2014 Abstract We propose a hierarchy of semidefinite
More informationSolving Box-Constrained Nonconvex Quadratic Programs
Noname manuscript No. (will be inserted by the editor) Solving Box-Constrained Nonconvex Quadratic Programs Pierre Bonami Oktay Günlük Jeff Linderoth June 13, 2016 Abstract We present effective computational
More informationCopositive Programming and Combinatorial Optimization
Copositive Programming and Combinatorial Optimization Franz Rendl http://www.math.uni-klu.ac.at Alpen-Adria-Universität Klagenfurt Austria joint work with I.M. Bomze (Wien) and F. Jarre (Düsseldorf) IMA
More informationLecture: Cone programming. Approximating the Lorentz cone.
Strong relaxations for discrete optimization problems 10/05/16 Lecture: Cone programming. Approximating the Lorentz cone. Lecturer: Yuri Faenza Scribes: Igor Malinović 1 Introduction Cone programming is
More informationConvexification of Mixed-Integer Quadratically Constrained Quadratic Programs
Convexification of Mixed-Integer Quadratically Constrained Quadratic Programs Laura Galli 1 Adam N. Letchford 2 Lancaster, April 2011 1 DEIS, University of Bologna, Italy 2 Department of Management Science,
More informationSparse Approximation via Penalty Decomposition Methods
Sparse Approximation via Penalty Decomposition Methods Zhaosong Lu Yong Zhang February 19, 2012 Abstract In this paper we consider sparse approximation problems, that is, general l 0 minimization problems
More informationLagrange Duality. Daniel P. Palomar. Hong Kong University of Science and Technology (HKUST)
Lagrange Duality Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization Fall 2017-18, HKUST, Hong Kong Outline of Lecture Lagrangian Dual function Dual
More informationSelected Examples of CONIC DUALITY AT WORK Robust Linear Optimization Synthesis of Linear Controllers Matrix Cube Theorem A.
. Selected Examples of CONIC DUALITY AT WORK Robust Linear Optimization Synthesis of Linear Controllers Matrix Cube Theorem A. Nemirovski Arkadi.Nemirovski@isye.gatech.edu Linear Optimization Problem,
More informationEE 227A: Convex Optimization and Applications October 14, 2008
EE 227A: Convex Optimization and Applications October 14, 2008 Lecture 13: SDP Duality Lecturer: Laurent El Ghaoui Reading assignment: Chapter 5 of BV. 13.1 Direct approach 13.1.1 Primal problem Consider
More informationA comparison of sequencing formulations in a constraint generation procedure for avionics scheduling
A comparison of sequencing formulations in a constraint generation procedure for avionics scheduling Department of Mathematics, Linköping University Jessika Boberg LiTH-MAT-EX 2017/18 SE Credits: Level:
More informationarxiv: v1 [math.oc] 31 Jan 2017
CONVEX CONSTRAINED SEMIALGEBRAIC VOLUME OPTIMIZATION: APPLICATION IN SYSTEMS AND CONTROL 1 Ashkan Jasour, Constantino Lagoa School of Electrical Engineering and Computer Science, Pennsylvania State University
More informationEquivalent relaxations of optimal power flow
Equivalent relaxations of optimal power flow 1 Subhonmesh Bose 1, Steven H. Low 2,1, Thanchanok Teeraratkul 1, Babak Hassibi 1 1 Electrical Engineering, 2 Computational and Mathematical Sciences California
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 informationThe use of predicates to state constraints in Constraint Satisfaction is explained. If, as an
of Constraint Satisfaction in Integer Programming H.P. Williams Hong Yan Faculty of Mathematical Studies, University of Southampton, Southampton, UK Department of Management, The Hong Kong Polytechnic
More informationOptimization in Process Systems Engineering
Optimization in Process Systems Engineering M.Sc. Jan Kronqvist Process Design & Systems Engineering Laboratory Faculty of Science and Engineering Åbo Akademi University Most optimization problems in production
More informationE5295/5B5749 Convex optimization with engineering applications. Lecture 5. Convex programming and semidefinite programming
E5295/5B5749 Convex optimization with engineering applications Lecture 5 Convex programming and semidefinite programming A. Forsgren, KTH 1 Lecture 5 Convex optimization 2006/2007 Convex quadratic program
More informationInderjit Dhillon The University of Texas at Austin
Inderjit Dhillon The University of Texas at Austin ( Universidad Carlos III de Madrid; 15 th June, 2012) (Based on joint work with J. Brickell, S. Sra, J. Tropp) Introduction 2 / 29 Notion of distance
More informationComparing Convex Relaxations for Quadratically Constrained Quadratic Programming
Comparing Convex Relaxations for Quadratically Constrained Quadratic Programming Kurt M. Anstreicher Dept. of Management Sciences University of Iowa European Workshop on MINLP, Marseille, April 2010 The
More informationSemidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5
Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Instructor: Farid Alizadeh Scribe: Anton Riabov 10/08/2001 1 Overview We continue studying the maximum eigenvalue SDP, and generalize
More informationStrong Formulations of Robust Mixed 0 1 Programming
Math. Program., Ser. B 108, 235 250 (2006) Digital Object Identifier (DOI) 10.1007/s10107-006-0709-5 Alper Atamtürk Strong Formulations of Robust Mixed 0 1 Programming Received: January 27, 2004 / Accepted:
More informationLinear and conic programming relaxations: Graph structure and message-passing
Linear and conic programming relaxations: Graph structure and message-passing Martin Wainwright UC Berkeley Departments of EECS and Statistics Banff Workshop Partially supported by grants from: National
More informationRobust Quadratic Programming with Mixed-Integer Uncertainty
Robust Quadratic Programming with Mixed-Integer Uncertainty Can Gokalp, Areesh Mittal, and Grani A. Hanasusanto Graduate Program in Operations Research and Industrial Engineering, The University of Texas
More informationOn the Moreau-Yosida regularization of the vector k-norm related functions
On the Moreau-Yosida regularization of the vector k-norm related functions Bin Wu, Chao Ding, Defeng Sun and Kim-Chuan Toh This version: March 08, 2011 Abstract In this paper, we conduct a thorough study
More informationDesigning Survivable Networks: A Flow Based Approach
Designing Survivable Networks: A Flow Based Approach Prakash Mirchandani 1 University of Pittsburgh This is joint work with Anant Balakrishnan 2 of the University of Texas at Austin and Hari Natarajan
More informationmany authors. For an overview see e.g. [5, 6, 3, 6]. In practice the modeling of the investigated region as the complete IR is not realistic. There ma
Planar Weber Location Problems with Line Barriers K. Klamroth Λ Universität Kaiserslautern Abstract The Weber problem for a given finite set of existing facilities in the plane is to find the location
More informationAcyclic Semidefinite Approximations of Quadratically Constrained Quadratic Programs
Acyclic Semidefinite Approximations of Quadratically Constrained Quadratic Programs Raphael Louca & Eilyan Bitar School of Electrical and Computer Engineering American Control Conference (ACC) Chicago,
More informationConcepts and Applications of Stochastically Weighted Stochastic Dominance
Concepts and Applications of Stochastically Weighted Stochastic Dominance Jian Hu Department of Industrial Engineering and Management Sciences Northwestern University jianhu@northwestern.edu Tito Homem-de-Mello
More informationHow to generate weakly infeasible semidefinite programs via Lasserre s relaxations for polynomial optimization
CS-11-01 How to generate weakly infeasible semidefinite programs via Lasserre s relaxations for polynomial optimization Hayato Waki Department of Computer Science, The University of Electro-Communications
More informationNotes on the decomposition result of Karlin et al. [2] for the hierarchy of Lasserre by M. Laurent, December 13, 2012
Notes on the decomposition result of Karlin et al. [2] for the hierarchy of Lasserre by M. Laurent, December 13, 2012 We present the decomposition result of Karlin et al. [2] for the hierarchy of Lasserre
More informationRobust Convex Quadratically Constrained Quadratic Programming with Mixed-Integer Uncertainty
Robust Convex Quadratically Constrained Quadratic Programming with Mixed-Integer Uncertainty Can Gokalp, Areesh Mittal, and Grani A. Hanasusanto Graduate Program in Operations Research and Industrial Engineering,
More informationFast ADMM for Sum of Squares Programs Using Partial Orthogonality
Fast ADMM for Sum of Squares Programs Using Partial Orthogonality Antonis Papachristodoulou Department of Engineering Science University of Oxford www.eng.ox.ac.uk/control/sysos antonis@eng.ox.ac.uk with
More informationContinuous Optimisation, Chpt 7: Proper Cones
Continuous Optimisation, Chpt 7: Proper Cones Peter J.C. Dickinson DMMP, University of Twente p.j.c.dickinson@utwente.nl http://dickinson.website/teaching/2017co.html version: 10/11/17 Monday 13th November
More informationStabilized Branch-and-cut-and-price for the Generalized Assignment Problem
Stabilized Branch-and-cut-and-price for the Generalized Assignment Problem Alexandre Pigatti, Marcus Poggi de Aragão Departamento de Informática, PUC do Rio de Janeiro {apigatti, poggi}@inf.puc-rio.br
More informationRobust combinatorial optimization with variable budgeted uncertainty
Noname manuscript No. (will be inserted by the editor) Robust combinatorial optimization with variable budgeted uncertainty Michael Poss Received: date / Accepted: date Abstract We introduce a new model
More informationSection Notes 9. IP: Cutting Planes. Applied Math 121. Week of April 12, 2010
Section Notes 9 IP: Cutting Planes Applied Math 121 Week of April 12, 2010 Goals for the week understand what a strong formulations is. be familiar with the cutting planes algorithm and the types of cuts
More informationSolving the Order-Preserving Submatrix Problem via Integer Programming
Solving the Order-Preserving Submatrix Problem via Integer Programming Andrew C. Trapp, Oleg A. Prokopyev Department of Industrial Engineering, University of Pittsburgh, Pittsburgh, Pennsylvania 15261,
More informationProvably Near-Optimal Solutions for Very Large Single-Row Facility Layout Problems
Provably Near-Optimal Solutions for Very Large Single-Row Facility Layout Problems Miguel F. Anjos Ginger Yen May 13, 008 (Revised January 4, 009; March 14, 009) Abstract The facility layout problem is
More informationBilevel Integer Optimization: Theory and Algorithms
: Theory and Algorithms Ted Ralphs 1 Joint work with Sahar Tahernajad 1, Scott DeNegre 3, Menal Güzelsoy 2, Anahita Hassanzadeh 4 1 COR@L Lab, Department of Industrial and Systems Engineering, Lehigh University
More informationPart 4. Decomposition Algorithms
In the name of God Part 4. 4.4. Column Generation for the Constrained Shortest Path Problem Spring 2010 Instructor: Dr. Masoud Yaghini Constrained Shortest Path Problem Constrained Shortest Path Problem
More informationExtended Formulations, Lagrangian Relaxation, & Column Generation: tackling large scale applications
Extended Formulations, Lagrangian Relaxation, & Column Generation: tackling large scale applications François Vanderbeck University of Bordeaux INRIA Bordeaux-Sud-Ouest part : Defining Extended Formulations
More informationCopositive Programming and Combinatorial Optimization
Copositive Programming and Combinatorial Optimization Franz Rendl http://www.math.uni-klu.ac.at Alpen-Adria-Universität Klagenfurt Austria joint work with M. Bomze (Wien) and F. Jarre (Düsseldorf) and
More informationStudying Spin Glasses via Combinatorial Optimization
Studying Spin Glasses via Combinatorial Optimization Frauke Liers Emmy Noether Junior Research Group, Department of Computer Science, University of Cologne Dec 11 th, 2007 What we are interested in...
More informationRecoverable Robust Knapsacks: Γ -Scenarios
Recoverable Robust Knapsacks: Γ -Scenarios Christina Büsing, Arie M. C. A. Koster, and Manuel Kutschka Abstract In this paper, we investigate the recoverable robust knapsack problem, where the uncertainty
More informationParallel PIPS-SBB Multi-level parallelism for 2-stage SMIPS. Lluís-Miquel Munguia, Geoffrey M. Oxberry, Deepak Rajan, Yuji Shinano
Parallel PIPS-SBB Multi-level parallelism for 2-stage SMIPS Lluís-Miquel Munguia, Geoffrey M. Oxberry, Deepak Rajan, Yuji Shinano ... Our contribution PIPS-PSBB*: Multi-level parallelism for Stochastic
More informationOn Solving SOCPs with an Interior-Point Method for NLP
On Solving SOCPs with an Interior-Point Method for NLP Robert Vanderbei and Hande Y. Benson INFORMS Nov 5, 2001 Miami Beach, FL Operations Research and Financial Engineering, Princeton University http://www.princeton.edu/
More informationThe multi-period incremental service facility location problem
Computers & Operations Research ( ) www.elsevier.com/locate/cor The multi-period incremental service facility location problem Maria Albareda-Sambola a,, Elena Fernández a, Yolanda Hinojosa b, Justo Puerto
More informationA Note on Nonconvex Minimax Theorem with Separable Homogeneous Polynomials
A Note on Nonconvex Minimax Theorem with Separable Homogeneous Polynomials G. Y. Li Communicated by Harold P. Benson Abstract The minimax theorem for a convex-concave bifunction is a fundamental theorem
More informationTwo-stage stochastic (and distributionally robust) p-order conic mixed integer programs: Tight second stage formulations
Two-stage stochastic (and distributionally robust p-order conic mixed integer programs: Tight second stage formulations Manish Bansal and Yingqiu Zhang Department of Industrial and Systems Engineering
More informationMINI-TUTORIAL ON SEMI-ALGEBRAIC PROOF SYSTEMS. Albert Atserias Universitat Politècnica de Catalunya Barcelona
MINI-TUTORIAL ON SEMI-ALGEBRAIC PROOF SYSTEMS Albert Atserias Universitat Politècnica de Catalunya Barcelona Part I CONVEX POLYTOPES Convex polytopes as linear inequalities Polytope: P = {x R n : Ax b}
More informationSemidefinite Facial Reduction for Euclidean Distance Matrix Completion
Semidefinite Facial Reduction for Euclidean Distance Matrix Completion Nathan Krislock, Henry Wolkowicz Department of Combinatorics & Optimization University of Waterloo First Alpen-Adria Workshop on Optimization
More informationLecture 5. Theorems of Alternatives and Self-Dual Embedding
IE 8534 1 Lecture 5. Theorems of Alternatives and Self-Dual Embedding IE 8534 2 A system of linear equations may not have a solution. It is well known that either Ax = c has a solution, or A T y = 0, c
More informationOn deterministic reformulations of distributionally robust joint chance constrained optimization problems
On deterministic reformulations of distributionally robust joint chance constrained optimization problems Weijun Xie and Shabbir Ahmed School of Industrial & Systems Engineering Georgia Institute of Technology,
More informationPreliminaries Overview OPF and Extensions. Convex Optimization. Lecture 8 - Applications in Smart Grids. Instructor: Yuanzhang Xiao
Convex Optimization Lecture 8 - Applications in Smart Grids Instructor: Yuanzhang Xiao University of Hawaii at Manoa Fall 2017 1 / 32 Today s Lecture 1 Generalized Inequalities and Semidefinite Programming
More informationA new look at nonnegativity on closed sets
A new look at nonnegativity on closed sets LAAS-CNRS and Institute of Mathematics, Toulouse, France IPAM, UCLA September 2010 Positivstellensatze for semi-algebraic sets K R n from the knowledge of defining
More informationOutline. 1 Introduction. 2 Modeling and Applications. 3 Algorithms Convex. 4 Algorithms Nonconvex. 5 The Future of MINLP? 2 / 126
Outline 1 Introduction 2 3 Algorithms Convex 4 Algorithms Nonconvex 5 The Future of MINLP? 2 / 126 Larry Leading Off 3 / 126 Introduction Outline 1 Introduction Software Tools and Online Resources Basic
More information8 Approximation Algorithms and Max-Cut
8 Approximation Algorithms and Max-Cut 8. The Max-Cut problem Unless the widely believed P N P conjecture is false, there is no polynomial algorithm that can solve all instances of an NP-hard problem.
More informationMoments and Positive Polynomials for Optimization II: LP- VERSUS SDP-relaxations
Moments and Positive Polynomials for Optimization II: LP- VERSUS SDP-relaxations LAAS-CNRS and Institute of Mathematics, Toulouse, France Tutorial, IMS, Singapore 2012 LP-relaxations LP- VERSUS SDP-relaxations
More information