Integer Programming, Part 1
|
|
- Cuthbert Blair
- 6 years ago
- Views:
Transcription
1 Integer Programming, Part 1 Rudi Pendavingh Technische Universiteit Eindhoven May 18, 2016 Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
2 Linear Inequalities and Polyhedra Farkas Lemma / Linear Programming Prerequisites for the course: (Farkas Lemma) The system Ax b is infeasible if and only if the system ua = 0, ub < 0, u 0 is feasible. Let P := {x : Ax b} and D := {u : ua = c, u 0}. (Linear Programming Duality) If P and D are both nonempty, then max{cx : x P} = min{ub : u D}. (Complementary slackness) Let x P and u D. Then x and u are both optimal if and only if ui (a i x b i ) = 0 for all i where a i denotes the i-the row of matrix A. Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
3 Linear Inequalities and Polyhedra Affine, Convex, and Conic Combinations Let x 1,..., x k R n and λ 1..., λ k R. Then is a linear combination of x 1,..., x k. x is an affine combination if i λ i = 1 x = λ 1 x λ k x k x is a convex combination if i λ i = 1 and λ i 0 for all i x is a nonnegative combination if λ i 0 for all i Let S R n be any set of vectors. linear hull affine hull The convex hull cone of S is the set of all linear affine convex nonnegative combinations of x 1,..., x k S. A set S is affine if S = aff(s), convex if S = conv (S), a cone if S = cone (S). Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
4 Linear Inequalities and Polyhedra Polyhedra and the of Minkowski-Weyl Let C R n. C is a polyhedral cone if C = {x : Ax 0} for some matrix A. C is finitely generated if C = cone {r 1,..., r q } for some vectors r 1,..., r q (Minkowski-Weyl for cones) Let C R n. Then C is a finitely generated cone if and only if C is a polyhedral cone. Example Let C := {x R 2 : x 1 x 2 0, 2x 1 + x 1 0} be a polyhedral cone. Then C = cone {(1, 1), (1, 2)}, so C is also a finitely generated cone. Example Let C := cone {(1, 5), (1, 1), (4, 1)} be a finitely generated cone. Then C := {x R 2 : x 1 4x x 1 + x 2 0}, so C is also a polyhedral cone. Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
5 Linear Inequalities and Polyhedra Polyhedra and the of Minkowski-Weyl P R n is a polyhedron if P = {x : Ax b} for some A, b. Q R n is a polytope if Q = conv {v 1,..., v p } for some vectors v 1,..., v p the Minkowski sum of A, B R n is A + B := {a + b : a A, b B} (Minkowski-Weyl for polyhedra) Let P R n. Then P is a polyhedron if and only if P = Q + C for some polytope Q and some finitely generated cone C. Proof. : If P = {x : Ax b}, consider C P := {(x, y) : Ax by 0, x R n, y R}. : If P = Q + C = conv {v 1,..., v p } + cone {r 1,..., r q }, consider C P := cone {( v 1 1 ) ( v p,..., 1 In either case, apply Minkowski-Weyl for cones. ) ( r 1, 0 ) ( r q,..., 0 )} Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
6 Linear Inequalities and Polyhedra Polyhedra and the of Minkowski-Weyl Example Consider P = {x R 2 : x 1 0, x 2 0, x 1 + x 2 2, x 1 + 2x 2 3}. Then P = Q + C, where {( ) ( ) ( )} {( ) ( )} Q = conv,,, C = cone, Example Consider P = {x R 3 : x 1 0, x 2 0, x 1 + x 2 1}. Then P = Q + C, where Q = conv 0, 1, C = cone 0, 1, 0, Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
7 Linear Inequalities and Polyhedra Lineality Space and Recession Cone Let P R n be a nonempty polyhedron. the lineality space of P is lin(p) := {r R n : x + λr P for all x P and λ R} the recession cone of P is rec(p) := {r R n : x + λr P for all x P and λ R + } Suppose P = {x : Ax b} = conv {v 1,..., v p } + cone {r 1,..., r q }. Then Example lin(p) = {x : Ax = 0} and rec(p) = {r : Ar 0} = cone {r 1,..., r q } Consider again the polyhedron P = {x R 3 : x 1 0, x 2 0, x 1 + x 2 1}. Then lin(p) = {x R 3 : x 1 = x 2 = 0} rec(p) = {r R 3 : r 1 0, r 2 0} = cone 1 0 0, 0 1 0, 0 0 1, Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
8 Linear Inequalities and Polyhedra Implicit Equalities, Affine Hull, and Dimension The system Ax b consists of inequalities a i x b i for i M a i x b i is an implicit equality of Ax b if a i x = b i for all x such that Ax b A = x b = denotes the subsystem of Ax b containing all implicit equalities for any P R n, dim(p) := dim(aff(p)) Let P = {x R n : Ax b} be a nonempty polyhedron. Then Furthermore, dim(p) = n rank(a = ). aff(p) = {x : A = x = b = } = {x : A = x b = } Example The assignment polytope P = x Rn2 : i x ij = 1 for all j, x ij = 1 for all i, x ij 0 for all i, j j has dimension n 2 2n + 1 Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
9 Linear Inequalities and Polyhedra Faces Let P R n. An inequality cx δ is valid for P if cx δ for all x P A face of P is a set F of the form F = P {x R n : cx = δ} where cx δ is a valid inequality for P Let P = {x : a i x b i for i M}, and for each I M put F I := {x R n : a i x = b i for all i I, and a i x b i for all i M \ I } For each I M, F I is a face of P. Conversely, if F is a nonempty face of P, then F = F I for some I M. It follows that the number of faces of polyhedron P is finite. Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
10 Linear Inequalities and Polyhedra Minimal Representation and Facets Let P = {x : a i x b i for i M}. The inequality a j x b j is redundant if it is valid for {x : a i x b i for all i M \ {j}} a i x b i for i M is a minimal representation of P if a i x b i is irredundant for i M A face F of P is proper if F and F P A facet of P is an proper face of P not strictly contained in another proper face of P For each facet F of P there is an inequality a i x b i so that F = P {x R n : a i x = b i }. Conversely, if the inequality a i x b i is irredundant and not an implied equation, then F = P {x R n : a i x = b i } is a facet of P. So in a minimal representation of P, each inequality is an implied equation or defines a facet. Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
11 Linear Inequalities and Polyhedra Minimal Faces Let P be a nonempty polyhedron. a set F is a minimal face of P if F is a face of P which does not contain a proper face Let P = {x R n : Ax b}. The a nonempty face F of P is a minimal face if and only if F = {x : A x = b } for some subsystem A x b of Ax b such that rank(a ) = rank(a). a set F is a vertex of P if F is a face of P of dimension 0, i.e. F = {x} P is pointed if P has a vertex Let P = {x R n : Ax b}. If P is pointed, then equivalent: {x} is a vertex x satisfies n linearly independent inequalities from Ax b with equality there are no x, x P \ {x} so that x is a convex combination of x, x. Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
12 Linear Inequalities and Polyhedra Decomposition for Polyhedra Let P be any nonempty polyhedron. Put t := dim(lin(p)) let F 1,..., F p be the minimal faces of P; let v i F 1 let R 1,..., R q be the (t + 1)-dimensional faces of rec(p); let r i R i \ lin(p) P = conv {v 1,..., v p } + cone {r 1,..., r p } + lin(p) Proof. The special case where t = 0 reduces to Minkowski-Weyl. If t > 0, let a 1,..., a t be a basis of lin(p). Then P = Q + lin(p) where Q := {x P : a i x = 0 for i = 1,... t} We have dim(lin(q)) = 0, and hence Q = conv {v 1,..., v p } + cone {r 1,..., r p }. Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
13 Homework Sections 3.1, 3.2, 3.3, 3.14 are prerequisite knowledge for the course. Review these sections if necessary, and verify that you are able to make exercises 3.1, 3.2, Read sections Make exercises 3.7, 3.10, 3.16, Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
14 Properties of Integral Polyhedra A polyhedron P R n is integral if P = conv (P Z n ). If P is integral, then max{cx : x P Z n } = max{cx : x P} is an ordinary linear program. We want to write combinatorial optimization problems as optimization over integral polyhedra. We next develop some tools for proving that a polyhedron P is integral. Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
15 Properties of Integral Polyhedra P R n a rational polyhedron. Then equivalent: 1 P = conv (P Z n ) 2 F Z n for every minimal face F of P 3 max{cx : x P} attained by integral vector x P Z n for each c R n, if attained at all 4 max{cx : x P} Z { } for each c Z n Proof. Some of the implications are straightforward... Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
16 Properties of Integral Polyhedra P R n a rational polyhedron. Then equivalent: 1 P = conv (P Z n ) 2 F Z n for every minimal face F of P 3 max{cx : x P} attained by integral vector x P Z n for each c R n, if attained at all 4 max{cx : x P} Z { } for each c Z n Proof. (4) (2): We may assume P = {x : Ax b} for some A, b with integer entries Consider a minimal face F. F = {x : A F x = b F } for a subsystem A F x b F of Ax b Suppose F Z n = ; then ua Z n and ub Z for some u. W.l.o.g. u 0 With c := ua, z := ub, we have cx = uax ub = z for all x P, with equality if x F. Then max{cx : x P} = z Z Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
17 Properties of Integral Polyhedra P R n a rational polyhedron. Then equivalent: 1 P = conv (P Z n ) 2 F Z n for every minimal face F of P 3 max{cx : x P} attained by integral vector x P Z n for each c R n, if attained at all 4 max{cx : x P} Z { } for each c Z n Proof. (2) (1): We may again assume P = {x : Ax b} for some A, b with integer entries Let F 1,..., F p be the minimal faces of P, and pick any v i F i Z n for each i. Then P = conv {v 1,..., v p } + rec(p) rec(p) = {r : Ar 0} = cone {r 1,..., r q } for some rational r i, since A is rational. Scaling the r j, we may assume r j Z n for all j. So P = conv {v 1,..., v p } + cone {r 1,..., r q } with v i, r j Z n, hence P = conv (P Z n ) Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
18 Total Unimodularity We next consider the question: Which matrices A are such that {x : Ax b, x 0} is integral for all b Z n? A matrix A is totally unimodular (TU) if det(b) { 1, 0, 1} for every square submatrix B of A Lemma If B is an integer matrix such that det(b) { 1, 1}, then B 1 is an integer matrix. (Hoffman and Kruskal) A is TU {x : Ax b, x 0} is integral for each b Z n. Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
19 Total Unimodularity If A is a matrix, then an equitable bicoloring of A is a partiton of the columns into red and blue columns so that A j A j { 1, 0, 1} m j red Here A j is the j-th column of A. j blue A TU every column submatrix admits an equitable bicoloring. Proof. = : Let B be a column submatrix of A. Since A is TU, so is B. The polyhedron P := {x : 1 2 B1 Bx 1 B1, 0 x 1} 2 contains an x Z n. Let the i-th column be red if x i = 0, blue otherwise. Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
20 Total Unimodularity If A is a matrix, then an equitable bicoloring of A is a partiton of the columns into red and blue columns so that A j A j {0, 1} m j red Here A j is the j-th column of A. j blue A TU every column submatrix admits an equitable bicoloring. Proof. =: Suppose not. Let B be a smallest submatrix of A with δ := det(b) { 1, 0, 1}. Then δb 1 is a 0, ±1-matrix. Let d be the first column of δb 1. Then Bd = δe 1. If δ is even, then δ = 0. If δ is odd, then δ = 1. Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
21 Total Unimodularity If A is a matrix, then an equitable bicoloring of A is a partiton of the columns into red and blue columns so that A j A j {0, 1} m j red Here A j is the j-th column of A. j blue A TU every column submatrix admits an equitable bicoloring. The signed incidence matrix of a directed graph D = (V, A) is the V A matrix A D with entries a va { 1, 0, 1} such that 1 if v is the tail of a a va = 1 if v is the head of a 0 otherwise Corollary The incidence matrix of any directed graph D = (V, A) is totally unimodular. Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
22 Homework Read 4.1, 4.2, and first two pages of 4.3. Try to fully understand all calls to other theorems in the proof of Thm 4.1. Make exercises 4.3, 4.4, 4.5, 4.6. Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
23 Total Dual Integrality A rational system Ax b is totally dual integral (TDI) if min{yb : ya = c, y 0} either has an integral optimal solution or is infeasible for each c Z n. If Ax b is TDI and b integral, then {x : Ax b} is integral. Proof. If Ax b is TDI and b integral, then min{yb : ya = c, y 0} Z { } for each c Z n. Hence max{cx : Ax b} Z { } for each c Z n, so that {x : Ax b} is integral. We next show: If P is rational, then there exists a TDI system Ax b so that P = {x : Ax b}. If P is (rational and) integral, then there exists a TDI system Ax b so that P = {x : Ax b} and b integral. Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
24 Total Dual Integrality If P is rational, then there exists a TDI system Ax b so that P = {x : Ax b}. Proof. if P =, then P = {x : 0x 1} P is rational, so we may assume P = {x : Mx d} for integer M, d Put C := {c Z n : c = λm, 0 λ 1}, δ c = max{cx : x P} for all c C let Ax b be the system of all inequalities cx δ c for c C P {x : Ax b} {x : Mx d} = P, so we have equality throughout to show that Ax b is TDI, consider a c Z n so that max{cx : Ax b} is finite max{cx : Ax b} = max{cx : Mx d} = min{yd : ym = c, y 0} has an optimal solution y ; put λ = y y, c := λm, c := y M; min{yd : ym = c, y 0} = min{yd : ym = c, y 0} + min{yd : ym = c, y 0}, so λ, y are optimal solutions for the latter two problems min{yd : ym = c, y 0} = max{c x : x P} = δ c, and c x δ c is a row of Ax b min{yb : ya = c, y 0} has an integer optimal solution obtained from y and c Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
25 Total Dual Integrality If P is integral, then there exists a TDI system Ax b so that P = {x : Ax b} and b integral. Proof. If P is integer, then in the previous proof δ c := max{cx : x P} Z for each c C Z n Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
26 Fundamental of Integer Programming Let A, G be rational matrices, b a rational vector. Put Then: P := {(x, y) : Ax + Gy b}, S := {(x, y) : Ax + Gy b, x Z n }. 1 A, G, b rational so that conv (S) = {(x, y) : A x + G y b }. 2 if S, then the recession cones of P and conv (S) coincide. Proof. P = conv {v 1,..., v t } + cone {r 1,..., r q } for some rational v i, integral r j. Consider T := { i λ iv i + j µ jr j : λ i = 1, λ 0, 0 µ 1} Put T I := {(x, y) T : x Z n }, R I := { j µ jr j : µ Z q + } S = T I + R I ; hence conv (S) = conv (T I ) + conv (R I ) conv (T I ) is a rational polyhedron, rec(conv (S)) = conv (R I ) = cone {r 1,..., r q } = rec(p) is a rational cone Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
27 Homework Read sections 4.6, 4.8. Make exercises 4.9, 4.11, 4.18, Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
28 Matchings in Graphs A matching in an undirected graph G = (V, E) is a set of pairwise disjoint edges M E. IP (Maximum cardinality matching) max e E x e e δ(v) x e 1 x {0, 1} E v V Let and put P(G) := conv {x {0, 1} E : x e 1 for all v V } e δ(v) Q(G) := {x R E : x e 1 for all v V, x 0} e δ(v) Is Q(G) integral for all undirected graphs G = (V, E), i.e. is P(G) = Q(G)? Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
29 Matchings in Graphs The incidence matrix of an undirected graph G = (V, E) is the V E matrix A G with entries a ve {0, 1} such that { 1 if v is incident with e a ve = 0 otherwise Clearly Q(G) = {x R E : x e 1 for all v V, x 0} = {x R E : A G x 1, x 0} e δ(v) Lemma The incidence matrix of G is totally unimodular if and only if G is bipartite. If G is bipartite, then P(G) is integral. Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
30 Matchings in Graphs Lemma P(G) := conv {x {0, 1} E : e δ(v) If G = (V, E) then for any U V with U odd the inequality is valid for P(G). e E[U] x e U 1 2 x e 1 for all v V } Is P(G) = {x R E : x e 1 for all v V,?? e δ(v) e E[U] x e U 1 2 for all odd U V, x 0} Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
31 Matchings in Graphs Let G = (V, E) be a graph. The polyhedron {x R E : x e = 1 for all v V, x e 1 for all odd U V, x 0} e δ(v) e δ(u) is integral. Proof. Suppose not. let G = (V, E) be a counterexample to the theorem with V + E as small as possible. let x be a fractional vertex of the polyhedron; there is some odd U so that e δ(u) x e = 1 x is a convex combination of integer vectors in the polyhedron, contradiction Applying the theorem to a doubled version of G, it then follows that P(G) = {x R E : x e 1 for all v V, x e U 1 for all odd U V, x 0} 2 e δ(v) e E[U] Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
32 Spanning Trees A spanning tree of G = (V, E) is a set T E so that (V, T ) is acyclic and connected. IP (Maximum weight spanning tree) max e E w ex e e E[S] x e S 1 e E x e = V 1 x {0, 1} E S V, S P(G) := {x R E : x e S 1 for all nonempty S V, e E[S] x e = V 1, x 0} e E P(G) is integral. Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
33 Submodular Polyhedra Let N be a finite set. A function f : 2 N R is submodular if f (S) + f (T ) f (S T ) + f (S T ) Example Let G = (V, E) be an undirected graph and let f : 2 V R be defined by f (S) := δ(s). Then f is submodular. Let G = (V, E) be an undirected graph and let f : 2 E R be defined by Then f is submodular. The submodular polyhedron is f (S) := V # of components of (V, S) P(f ) := {x R N : j S x j f (S) for all S N} Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
34 Submodular Polyhedra The submodular polyhedron is P(f ) := {x R N : j S x j f (S) for all S N} Suppose f : 2 N Z is submodular and f ( ) = 0. Then P(f ) is integral, and the system j S x j f (S) for all S N is TDI. Proof. Let c Z n. Consider max{cx : j S x j f (S) for all S N}. W.l.o.g. c 1 c 2... c n. A feasible solution x is obtained by setting x j := f (S j ) f (S j 1 ), where S j := {1,..., j}. The dual is min{ f (S)y S : y S = c j for all j N, y 0} S N j S We construct an integral optimal solution ȳ for this problem so that c x = S N f (S)y S proving optimality of both integral solutions. Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
35 (Nash-Williams orientation theorem) A 2k-connected undirected graph G can be oriented so as to become a k-connected directed graph. Proof. Let D = (V, A) arise from G by arbitrarily orienting the edges. if there is an x Z A so that 0 x 1, x[δ (U)] x[δ + (U)] δ (U) k for all U V ( ) then we are done by reversing the arcs a so that x a = 1. We consider the polyhedron P := {x R A : ( )}. Then x = 1 21 P, so P We will prove TDI-ness of ( ). Then P I = P, hence P Z A. Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
36 Proof. We prove TDI-ness of 0 x 1, x[δ (U)] x[δ + (U)] δ (U) k for all U V ( ) Consider the LP dual to maximizing cx over ( ). Let z be an optimal dual solution so that U z U U V \ U minimal. Then U := {U z U > 0} is cross-free, i.e. if T, U U, then U T, T U, U T = or U T = V The restricted system 0 x 1, x[δ (U)] x[δ + (U)] δ (U) k for all U U is totally unimodular. So the dual optimum is determined by this TU system, and hence is integral. Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
37 Homework Read sections 4.3, 4.4, 4.5, 4.7. Make exercises 4.9, 4.12, 4.14, Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, / 37
Chapter 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 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. 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 informationKey Things We Learned Last Time. IE418 Integer Programming. Proving Facets Way #2 Indirect. A More Abstract Example
Key Things We Learned Last Time IE48: Integer Programming Department of Industrial and Systems Engineering Lehigh University 8th March 5 A face F is said to be a facet of P if dim(f ) = dim(p ). All facets
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 informationInteger Hulls of Rational Polyhedra. Rekha R. Thomas
Integer Hulls of Rational Polyhedra Rekha R. Thomas Department of Mathematics, University of Washington, Seattle, WA 98195 E-mail address: thomas@math.washington.edu The author was supported in part by
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 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 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 informationCutting Plane Methods I
6.859/15.083 Integer Programming and Combinatorial Optimization Fall 2009 Cutting Planes Consider max{wx : Ax b, x integer}. Cutting Plane Methods I Establishing the optimality of a solution is equivalent
More informationCS675: Convex and Combinatorial Optimization Fall 2016 Combinatorial Problems as Linear and Convex Programs. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Fall 2016 Combinatorial Problems as Linear and Convex Programs Instructor: Shaddin Dughmi Outline 1 Introduction 2 Shortest Path 3 Algorithms for Single-Source
More informationComputational Integer Programming Universidad de los Andes. Lecture 1. Dr. Ted Ralphs
Computational Integer Programming Universidad de los Andes Lecture 1 Dr. Ted Ralphs MIP Lecture 1 1 Quick Introduction Bio Course web site Course structure http://coral.ie.lehigh.edu/ ted/teaching/mip
More informationCS675: Convex and Combinatorial Optimization Fall 2014 Combinatorial Problems as Linear Programs. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Fall 2014 Combinatorial Problems as Linear Programs Instructor: Shaddin Dughmi Outline 1 Introduction 2 Shortest Path 3 Algorithms for Single-Source Shortest
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 informationExtended Formulations in Combinatorial Optimization
Extended Formulations in Combinatorial Optimization Michele Conforti Università di Padova, conforti@math.unipd.it Gérard Cornuéjols Carnegie Mellon University gc0v@andrew.cmu.edu Giacomo Zambelli London
More informationLinear Programming. Chapter Introduction
Chapter 3 Linear Programming Linear programs (LP) play an important role in the theory and practice of optimization problems. Many COPs can directly be formulated as LPs. Furthermore, LPs are invaluable
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 informationLectures 6, 7 and part of 8
Lectures 6, 7 and part of 8 Uriel Feige April 26, May 3, May 10, 2015 1 Linear programming duality 1.1 The diet problem revisited Recall the diet problem from Lecture 1. There are n foods, m nutrients,
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 informationFarkas Lemma. Rudi Pendavingh. Optimization in R n, lecture 2. Eindhoven Technical University. Rudi Pendavingh (TUE) Farkas Lemma ORN2 1 / 15
Farkas Lemma Rudi Pendavingh Eindhoven Technical University Optimization in R n, lecture 2 Rudi Pendavingh (TUE) Farkas Lemma ORN2 1 / 15 Today s Lecture Theorem (Farkas Lemma, 1894) Let A be an m n matrix,
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 informationOptimization methods NOPT048
Optimization methods NOPT048 Jirka Fink https://ktiml.mff.cuni.cz/ fink/ Department of Theoretical Computer Science and Mathematical Logic Faculty of Mathematics and Physics Charles University in Prague
More informationDiscrete Optimization 2010 Lecture 7 Introduction to Integer Programming
Discrete Optimization 2010 Lecture 7 Introduction to Integer Programming Marc Uetz University of Twente m.uetz@utwente.nl Lecture 8: sheet 1 / 32 Marc Uetz Discrete Optimization Outline 1 Intro: The Matching
More informationDiscrete Optimization
Prof. Friedrich Eisenbrand Martin Niemeier Due Date: April 15, 2010 Discussions: March 25, April 01 Discrete Optimization Spring 2010 s 3 You can hand in written solutions for up to two of the exercises
More informationDuality of LPs and Applications
Lecture 6 Duality of LPs and Applications Last lecture we introduced duality of linear programs. We saw how to form duals, and proved both the weak and strong duality theorems. In this lecture we will
More informationMinimally Infeasible Set Partitioning Problems with Balanced Constraints
Minimally Infeasible Set Partitioning Problems with alanced Constraints Michele Conforti, Marco Di Summa, Giacomo Zambelli January, 2005 Abstract We study properties of systems of linear constraints that
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 informationLecture 5 January 16, 2013
UBC CPSC 536N: Sparse Approximations Winter 2013 Prof. Nick Harvey Lecture 5 January 16, 2013 Scribe: Samira Samadi 1 Combinatorial IPs 1.1 Mathematical programs { min c Linear Program (LP): T x s.t. a
More informationLinear Algebra Review: Linear Independence. IE418 Integer Programming. Linear Algebra Review: Subspaces. Linear Algebra Review: Affine Independence
Linear Algebra Review: Linear Independence IE418: Integer Programming Department of Industrial and Systems Engineering Lehigh University 21st March 2005 A finite collection of vectors x 1,..., x k R n
More informationOptimization methods NOPT048
Optimization methods NOPT048 Jirka Fink https://ktiml.mff.cuni.cz/ fink/ Department of Theoretical Computer Science and Mathematical Logic Faculty of Mathematics and Physics Charles University in Prague
More informationCombinatorial Optimization
Combinatorial Optimization Lecture notes, WS 2010/11, TU Munich Prof. Dr. Raymond Hemmecke Version of February 9, 2011 Contents 1 The knapsack problem 1 1.1 Complete enumeration..................................
More information1 Perfect Matching and Matching Polytopes
CS 598CSC: Combinatorial Optimization Lecture date: /16/009 Instructor: Chandra Chekuri Scribe: Vivek Srikumar 1 Perfect Matching and Matching Polytopes Let G = (V, E be a graph. For a set E E, let χ E
More informationMinimal inequalities for an infinite relaxation of integer programs
Minimal inequalities for an infinite relaxation of integer programs Amitabh Basu Carnegie Mellon University, abasu1@andrew.cmu.edu Michele Conforti Università di Padova, conforti@math.unipd.it Gérard Cornuéjols
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 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 informationTRISTRAM BOGART AND REKHA R. THOMAS
SMALL CHVÁTAL RANK TRISTRAM BOGART AND REKHA R. THOMAS Abstract. We introduce a new measure of complexity of integer hulls of rational polyhedra called the small Chvátal rank (SCR). The SCR of an integer
More informationMinimal inequalities for an infinite relaxation of integer programs
Minimal inequalities for an infinite relaxation of integer programs Amitabh Basu Carnegie Mellon University, abasu1@andrew.cmu.edu Michele Conforti Università di Padova, conforti@math.unipd.it Gérard Cornuéjols
More informationMixed-integer linear representability, disjunctions, and variable elimination
Mixed-integer linear representability, disjunctions, and variable elimination Amitabh Basu Kipp Martin Christopher Thomas Ryan Guanyi Wang December 19, 2016 Abstract Jeroslow and Lowe gave an exact geometric
More informationDiscrete Optimization 23
Discrete Optimization 23 2 Total Unimodularity (TU) and Its Applications In this section we will discuss the total unimodularity theory and its applications to flows in networks. 2.1 Total Unimodularity:
More informationLecture notes on the ellipsoid algorithm
Massachusetts Institute of Technology Handout 1 18.433: Combinatorial Optimization May 14th, 007 Michel X. Goemans Lecture notes on the ellipsoid algorithm The simplex algorithm was the first algorithm
More informationAppendix PRELIMINARIES 1. THEOREMS OF ALTERNATIVES FOR SYSTEMS OF LINEAR CONSTRAINTS
Appendix PRELIMINARIES 1. THEOREMS OF ALTERNATIVES FOR SYSTEMS OF LINEAR CONSTRAINTS Here we consider systems of linear constraints, consisting of equations or inequalities or both. A feasible solution
More informationPolyhedral Approach to Integer Linear Programming. Tepper School of Business Carnegie Mellon University, Pittsburgh
Polyhedral Approach to Integer Linear Programming Gérard Cornuéjols Tepper School of Business Carnegie Mellon University, Pittsburgh 1 / 30 Brief history First Algorithms Polynomial Algorithms Solving
More information4. Duality Duality 4.1 Duality of LPs and the duality theorem. min c T x x R n, c R n. s.t. ai Tx = b i i M a i R n
2 4. Duality of LPs and the duality theorem... 22 4.2 Complementary slackness... 23 4.3 The shortest path problem and its dual... 24 4.4 Farkas' Lemma... 25 4.5 Dual information in the tableau... 26 4.6
More information4. Algebra and Duality
4-1 Algebra and Duality P. Parrilo and S. Lall, CDC 2003 2003.12.07.01 4. Algebra and Duality Example: non-convex polynomial optimization Weak duality and duality gap The dual is not intrinsic The cone
More informationThe Matching Polytope: General graphs
8.433 Combinatorial Optimization The Matching Polytope: General graphs September 8 Lecturer: Santosh Vempala A matching M corresponds to a vector x M = (0, 0,,, 0...0) where x M e is iff e M and 0 if e
More information7. Lecture notes on the ellipsoid algorithm
Massachusetts Institute of Technology Michel X. Goemans 18.433: Combinatorial Optimization 7. Lecture notes on the ellipsoid algorithm The simplex algorithm was the first algorithm proposed for linear
More informationTopics in Graph Theory
Topics in Graph Theory September 4, 2018 1 Preliminaries A graph is a system G = (V, E) consisting of a set V of vertices and a set E (disjoint from V ) of edges, together with an incidence function End
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 informationC&O 355 Mathematical Programming Fall 2010 Lecture 18. N. Harvey
C&O 355 Mathematical Programming Fall 2010 Lecture 18 N. Harvey Network Flow Topics Max Flow / Min Cut Theorem Total Unimodularity Directed Graphs & Incidence Matrices Proof of Max Flow / Min Cut Theorem
More informationDual Consistent Systems of Linear Inequalities and Cardinality Constrained Polytopes. Satoru FUJISHIGE and Jens MASSBERG.
RIMS-1734 Dual Consistent Systems of Linear Inequalities and Cardinality Constrained Polytopes By Satoru FUJISHIGE and Jens MASSBERG December 2011 RESEARCH INSTITUTE FOR MATHEMATICAL SCIENCES KYOTO UNIVERSITY,
More informationA Review of Linear Programming
A Review of Linear Programming Instructor: Farid Alizadeh IEOR 4600y Spring 2001 February 14, 2001 1 Overview In this note we review the basic properties of linear programming including the primal simplex
More informationMathematical Programs Linear Program (LP)
Mathematical Programs Linear Program (LP) Integer Program (IP) Can be efficiently solved e.g., by Ellipsoid Method Cannot be efficiently solved Cannot be efficiently solved assuming P NP Combinatorial
More informationConvex Analysis 2013 Let f : Q R be a strongly convex function with convexity parameter µ>0, where Q R n is a bounded, closed, convex set, which contains the origin. Let Q =conv(q, Q) andconsiderthefunction
More informationIntroduction to Linear and Combinatorial Optimization (ADM I)
Introduction to Linear and Combinatorial Optimization (ADM I) Rolf Möhring based on the 20011/12 course by Martin Skutella TU Berlin WS 2013/14 1 General Remarks new flavor of ADM I introduce linear and
More informationRESEARCH ARTICLE. An extension of the polytope of doubly stochastic matrices
Linear and Multilinear Algebra Vol. 00, No. 00, Month 200x, 1 15 RESEARCH ARTICLE An extension of the polytope of doubly stochastic matrices Richard A. Brualdi a and Geir Dahl b a Department of Mathematics,
More information3.7 Strong valid inequalities for structured ILP problems
3.7 Strong valid inequalities for structured ILP problems By studying the problem structure, we can derive strong valid inequalities yielding better approximations of conv(x ) and hence tighter bounds.
More information3.7 Cutting plane methods
3.7 Cutting plane methods Generic ILP problem min{ c t x : x X = {x Z n + : Ax b} } with m n matrix A and n 1 vector b of rationals. According to Meyer s theorem: There exists an ideal formulation: conv(x
More informationOn the dominant of the s-t-cut polytope: Vertices, facets, and adjacency
Math. Program., Ser. B DOI 10.1007/s10107-010-0373-7 FULL LENGTH PAPER On the dominant of the s-t-cut polytope: Vertices, facets, and adjacency Martin Skutella Alexia Weber Received: 15 August 2008 / Accepted:
More informationBBM402-Lecture 20: LP Duality
BBM402-Lecture 20: LP Duality Lecturer: Lale Özkahya Resources for the presentation: https://courses.engr.illinois.edu/cs473/fa2016/lectures.html An easy LP? which is compact form for max cx subject to
More informationIntroduction to Integer Programming
Lecture 3/3/2006 p. /27 Introduction to Integer Programming Leo Liberti LIX, École Polytechnique liberti@lix.polytechnique.fr Lecture 3/3/2006 p. 2/27 Contents IP formulations and examples Total unimodularity
More informationInteger Programming Methods LNMB
Integer Programming Methods LNMB 2017 2018 Dion Gijswijt homepage.tudelft.nl/64a8q/intpm/ Dion Gijswijt Intro IntPM 2017-2018 1 / 24 Organisation Webpage: homepage.tudelft.nl/64a8q/intpm/ Book: Integer
More informationACO Comprehensive Exam March 17 and 18, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms (a) Let G(V, E) be an undirected unweighted graph. Let C V be a vertex cover of G. Argue that V \ C is an independent set of G. (b) Minimum cardinality vertex
More informationOn mixed-integer sets with two integer variables
On mixed-integer sets with two integer variables Sanjeeb Dash IBM Research sanjeebd@us.ibm.com Santanu S. Dey Georgia Inst. Tech. santanu.dey@isye.gatech.edu September 8, 2010 Oktay Günlük IBM Research
More informationCutting Plane Methods II
6.859/5.083 Integer Programming and Combinatorial Optimization Fall 2009 Cutting Plane Methods II Gomory-Chvátal cuts Reminder P = {x R n : Ax b} with A Z m n, b Z m. For λ [0, ) m such that λ A Z n, (λ
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 informationWhen is the Matching Polytope Box-totally Dual Integral?
When is the Matching Polytope Box-totally Dual Integral? Guoli Ding a Lei Tan b Wenan Zang b a Mathematics Department, Louisiana State University Baton Rouge, LA 70803, USA b Department of Mathematics,
More informationAdvanced Linear Programming: The Exercises
Advanced Linear Programming: The Exercises The answers are sometimes not written out completely. 1.5 a) min c T x + d T y Ax + By b y = x (1) First reformulation, using z smallest number satisfying x z
More informationDeciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point
Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point Gérard Cornuéjols 1 and Yanjun Li 2 1 Tepper School of Business, Carnegie Mellon
More informationOn Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank
On ome Polytopes Contained in the 0,1 Hypercube that Have a mall Chvátal Rank Gérard Cornuéjols Dabeen Lee April 2016, revised July 2017 Abstract In this paper, we consider polytopes P that are contained
More informationInteger Programming ISE 418. Lecture 8. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 8 Dr. Ted Ralphs ISE 418 Lecture 8 1 Reading for This Lecture Wolsey Chapter 2 Nemhauser and Wolsey Sections II.3.1, II.3.6, II.4.1, II.4.2, II.5.4 Duality for Mixed-Integer
More informationAN INTRODUCTION TO CONVEXITY
AN INTRODUCTION TO CONVEXITY GEIR DAHL NOVEMBER 2010 University of Oslo, Centre of Mathematics for Applications, P.O.Box 1053, Blindern, 0316 Oslo, Norway (geird@math.uio.no) Contents 1 The basic concepts
More informationIntroduction to Integer Linear Programming
Lecture 7/12/2006 p. 1/30 Introduction to Integer Linear Programming Leo Liberti, Ruslan Sadykov LIX, École Polytechnique liberti@lix.polytechnique.fr sadykov@lix.polytechnique.fr Lecture 7/12/2006 p.
More informationSection Notes 8. Integer Programming II. Applied Math 121. Week of April 5, expand your knowledge of big M s and logical constraints.
Section Notes 8 Integer Programming II Applied Math 121 Week of April 5, 2010 Goals for the week understand IP relaxations be able to determine the relative strength of formulations understand the branch
More informationInteger programming: an introduction. Alessandro Astolfi
Integer programming: an introduction Alessandro Astolfi Outline Introduction Examples Methods for solving ILP Optimization on graphs LP problems with integer solutions Summary Introduction Integer programming
More informationCutting planes from extended LP formulations
Cutting planes from extended LP formulations Merve Bodur University of Wisconsin-Madison mbodur@wisc.edu Sanjeeb Dash IBM Research sanjeebd@us.ibm.com March 7, 2016 Oktay Günlük IBM Research gunluk@us.ibm.com
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 informationRelaxations and Bounds. 6.1 Optimality and Relaxations. Suppose that we are given an IP. z = max c T x : x X,
6 Relaxations and Bounds 6.1 Optimality and Relaxations Suppose that we are given an IP z = max c T x : x X, where X = x : Ax b,x Z n and a vector x X which is a candidate for optimality. Is there a way
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 informationComplete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs
Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs Matthias Walter RWTH Aachen University: walter@or.rwth-aachen.de July 7, 06 Abstract We consider, for
More informationOn the Rational Polytopes with Chvátal Rank 1
On the Rational Polytopes with Chvátal Rank 1 Gérard Cornuéjols Dabeen Lee Yanjun Li December 2016, revised May 2018 Abstract We study the following problem: given a rational polytope with Chvátal rank
More informationEllipsoidal Mixed-Integer Representability
Ellipsoidal Mixed-Integer Representability Alberto Del Pia Jeff Poskin September 15, 2017 Abstract Representability results for mixed-integer linear systems play a fundamental role in optimization since
More informationIntegrality of Polyhedra
4 Integrality of Polyhedra In this chapter we study properties of polyhedra P which ensure that the Linear Program max c T x : x P has optimal integral solutions. Definition 4.1 (Integral Polyhedron) ApolyhedronP
More informationMarch 2002, December Introduction. We investigate the facial structure of the convex hull of the mixed integer knapsack set
ON THE FACETS OF THE MIXED INTEGER KNAPSACK POLYHEDRON ALPER ATAMTÜRK Abstract. We study the mixed integer knapsack polyhedron, that is, the convex hull of the mixed integer set defined by an arbitrary
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 informationCombinatorial Optimization with One Quadratic Term: Spanning Trees and Forests
Combinatorial Optimization with One Quadratic Term: Spanning Trees and Forests Christoph Buchheim 1 and Laura Klein 1 1 Fakultät für Mathematik, TU Dortmund, Vogelpothsweg 87, 44227 Dortmund, Germany,
More informationSeparating Simple Domino Parity Inequalities
Separating Simple Domino Parity Inequalities Lisa Fleischer Adam Letchford Andrea Lodi DRAFT: IPCO submission Abstract In IPCO 2002, Letchford and Lodi describe an algorithm for separating simple comb
More informationPreliminaries and Complexity Theory
Preliminaries and Complexity Theory Oleksandr Romanko CAS 746 - Advanced Topics in Combinatorial Optimization McMaster University, January 16, 2006 Introduction Book structure: 2 Part I Linear Algebra
More informationLifting theorems and facet characterization for a class of clique partitioning inequalities
Operations Research Letters 24 (1999) 235 243 www.elsevier.com/locate/orms Lifting theorems and facet characterization for a class of clique partitioning inequalities Hans-Jurgen Bandelt a, Maarten Oosten
More informationDiscrete Optimization 2010 Lecture 8 Lagrangian Relaxation / P, N P and co-n P
Discrete Optimization 2010 Lecture 8 Lagrangian Relaxation / P, N P and co-n P Marc Uetz University of Twente m.uetz@utwente.nl Lecture 8: sheet 1 / 32 Marc Uetz Discrete Optimization Outline 1 Lagrangian
More informationCombinatorial Optimization
Combinatorial Optimization 2017-2018 1 Maximum matching on bipartite graphs Given a graph G = (V, E), find a maximum cardinal matching. 1.1 Direct algorithms Theorem 1.1 (Petersen, 1891) A matching M is
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 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 informationComputational Integer Programming. Lecture 2: Modeling and Formulation. Dr. Ted Ralphs
Computational Integer Programming Lecture 2: Modeling and Formulation Dr. Ted Ralphs Computational MILP Lecture 2 1 Reading for This Lecture N&W Sections I.1.1-I.1.6 Wolsey Chapter 1 CCZ Chapter 2 Computational
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 informationA Criterion for the Stochasticity of Matrices with Specified Order Relations
Rend. Istit. Mat. Univ. Trieste Vol. XL, 55 64 (2009) A Criterion for the Stochasticity of Matrices with Specified Order Relations Luca Bortolussi and Andrea Sgarro Abstract. We tackle the following problem:
More informationLattice closures of polyhedra
Lattice closures of polyhedra Sanjeeb Dash IBM Research sanjeebd@us.ibm.com Oktay Günlük IBM Research gunluk@us.ibm.com April 10, 2017 Diego A. Morán R. Universidad Adolfo Ibañez diego.moran@uai.cl Abstract
More informationPolynomiality of Linear Programming
Chapter 10 Polynomiality of Linear Programming In the previous section, we presented the Simplex Method. This method turns out to be very efficient for solving linear programmes in practice. While it is
More informationCS599: Convex and Combinatorial Optimization Fall 2013 Lecture 17: Combinatorial Problems as Linear Programs III. Instructor: Shaddin Dughmi
CS599: Convex and Combinatorial Optimization Fall 2013 Lecture 17: Combinatorial Problems as Linear Programs III Instructor: Shaddin Dughmi Announcements Today: Spanning Trees and Flows Flexibility awarded
More informationMaximum flow problem
Maximum flow problem 7000 Network flows Network Directed graph G = (V, E) Source node s V, sink node t V Edge capacities: cap : E R 0 Flow: f : E R 0 satisfying 1. Flow conservation constraints e:target(e)=v
More information