On the Chvatál-Complexity of Binary Knapsack Problems. Gergely Kovács 1 Béla Vizvári College for Modern Business Studies, Hungary
|
|
- Barbara Crawford
- 5 years ago
- Views:
Transcription
1 On the Chvatál-Complexity of Binary Knapsack Problems Gergely Kovács 1 Béla Vizvári 2 1 College for Modern Business Studies, Hungary 2 Eastern Mediterranean University, TRNC 2009.
2 1 Chvátal Cut and Complexity
3 1 Chvátal Cut and Complexity Chvátal's theory on the integer hull of a polyhedral set dened by the inequality system: Ax b, (1)
4 1 Chvátal Cut and Complexity Chvátal's theory on the integer hull of a polyhedral set dened by the inequality system: Ax b, (1) where A is an m n matrix, b and x are vectors of m and n dimensions, respectively.
5 Let λ IR m +. Assume that AT λ ZZ n.
6 Let λ IR m +. Assume that AT λ ZZ n. Then all integer vectors x of the polyhedral set must satisfy the inequality λ T Ax λ b T. (2)
7 Let λ IR m +. Assume that AT λ ZZ n. Then all integer vectors x of the polyhedral set must satisfy the inequality λ T Ax λ b T. (2) In general (2) is a valid cut of the integer hull.
8 Let λ IR m +. Assume that AT λ ZZ n. Then all integer vectors x of the polyhedral set must satisfy the inequality λ T Ax λ b T. (2) In general (2) is a valid cut of the integer hull. Furthermore if λ T b is non-integer then it will cut o a part of the polyhedral set.
9 It can be proven that:
10 It can be proven that: 1 there are only nite many signicantly dierent Chvátal cuts of type (2) and
11 It can be proven that: 1 there are only nite many signicantly dierent Chvátal cuts of type (2) and 2 if the Chvátal cuts added to the set of inequalities (1) and in this way a new the polyhedral set is dened, and the whole procedure is repeated,
12 It can be proven that: 1 there are only nite many signicantly dierent Chvátal cuts of type (2) and 2 if the Chvátal cuts added to the set of inequalities (1) and in this way a new the polyhedral set is dened, and the whole procedure is repeated, then after nite many iterations the polyhedral set becomes equal to the integer hull.
13 Denition. The number of iterations is called Chvátal rank.
14 2 Notations
15 2 Notations a 1 x 1 + a 2 x a n x n b, (3)
16 2 Notations a 1 x 1 + a 2 x a n x n b, (3) x j 0 j = 1,..., n
17 2 Notations a 1 x 1 + a 2 x a n x n b, (3) x j 0 j = 1,..., n x j 1 j = 1,..., n
18 2 Notations a 1 x 1 + a 2 x a n x n b, (3) x j 0 j = 1,..., n x j 1 j = 1,..., n where a 1, a 2,..., a n and b are positive integers.
19 2 Notations a 1 x 1 + a 2 x a n x n b, (3) x j 0 j = 1,..., n x j 1 j = 1,..., n where a 1, a 2,..., a n and b are positive integers. Furthermore a 1 a 2 a n. (4)
20 2.1 Indexing of Constraints index Right-Hand Side Left-Hand Side 0 a 1 x 1 + a 2 x a n x n b 1 x x 2 1. n x n 1 n + 1 x 1 0 n + 2 x n x n 0
21 Using the same index set the multipliers of the inequalities of this original constraint set are denoted by λ 0,..., λ 2n.
22 3 The Case of Dimensions 1, 2, and 3
23 3 The Case of Dimensions 1, 2, and 3 The case of n = 1.
24 3 The Case of Dimensions 1, 2, and 3 The case of n = 1. The set of integer feasible solutions:
25 3 The Case of Dimensions 1, 2, and 3 The case of n = 1. The set of integer feasible solutions: {0, 1}
26 3 The Case of Dimensions 1, 2, and 3 The case of n = 1. The set of integer feasible solutions: {0, 1} The Chvátal rank is zero.
27 3 The Case of Dimensions 1, 2, and 3 The case of n = 1. The set of integer feasible solutions: {0, 1} The Chvátal rank is zero. {0}
28 3 The Case of Dimensions 1, 2, and 3 The case of n = 1. The set of integer feasible solutions: {0, 1} The Chvátal rank is zero. {0} The Chvátal rank is one:
29 3 The Case of Dimensions 1, 2, and 3 The case of n = 1. The set of integer feasible solutions: {0, 1} The Chvátal rank is zero. {0} The Chvátal rank is one: λ 0 = 1/a 1, λ 1 = λ 2 = 0 implies x 1 0.
30 The case of n = 2.
31 The case of n = 2. The left-hand side of (3) is decreasing for the following sequence of binary vectors:
32 The case of n = 2. The left-hand side of (3) is decreasing for the following sequence of binary vectors: (1, 1), (0, 1), (1, 0), (0, 0).
33 The case of n = 2. The left-hand side of (3) is decreasing for the following sequence of binary vectors: (1, 1), (0, 1), (1, 0), (0, 0). The Chvátal rank is again either 0 or 1.
34 The case of n = 2. The left-hand side of (3) is decreasing for the following sequence of binary vectors: (1, 1), (0, 1), (1, 0), (0, 0). The Chvátal rank is again either 0 or 1. The case of n = 3.
35 The case of n = 2. The left-hand side of (3) is decreasing for the following sequence of binary vectors: (1, 1), (0, 1), (1, 0), (0, 0). The Chvátal rank is again either 0 or 1. The case of n = 3. The maximal elements of the feasible solutions belong to one of the cases of the table below:
36 case maximal vectors inequalities of the feasible set 1 (0, 0, 0) y i 0 2 (1, 0, 0) y 2 0, y (1, 0, 0), (0, 1, 0) y 1 + y 2 1, y (1, 1, 0) y (1, 0, 0), (0, 1, 0), (0, 0, 1) y 1 + y 2 + y (0, 0, 1), (1, 1, 0) y 1 + y 3 1, y 2 + y (1, 1, 0), (1, 0, 1) y 2 + y (1, 1, 0), (1, 0, 1), (0, 1, 1) y 1 + y 2 + y (1, 1, 1) empty
37 The knapsack problem has a Chvátal rank at most 1 in all of the cases.
38 The knapsack problem has a Chvátal rank at most 1 in all of the cases. The statement can be shown in a trivial way for cases 1, 2, 4, 9.
39 The knapsack problem has a Chvátal rank at most 1 in all of the cases. The statement can be shown in a trivial way for cases 1, 2, 4, 9. E. g. in case 4
40 The knapsack problem has a Chvátal rank at most 1 in all of the cases. The statement can be shown in a trivial way for cases 1, 2, 4, 9. E. g. in case 4 case maximal vector inequality of the feasible set 4 (1, 1, 0) y 3 0
41 The knapsack problem has a Chvátal rank at most 1 in all of the cases. The statement can be shown in a trivial way for cases 1, 2, 4, 9. E. g. in case 4 case maximal vector inequality of the feasible set 4 (1, 1, 0) y 3 0 the multipliers are: λ 0 = 1 a 3, λ 1 = 0, λ 2 = 0, λ 3 = 0, λ 4 = a 1 a 3, λ 5 = a 2 a 3, λ 6 = 0.
42 The other cases can be solved as follows.
43 The other cases can be solved as follows. Case 3: case maximal vectors inequalities of the feasible set 3 (1, 0, 0), (0, 1, 0) y 1 + y 2 1, y 3 0
44 The other cases can be solved as follows. Case 3: case maximal vectors inequalities of the feasible set 3 (1, 0, 0), (0, 1, 0) y 1 + y 2 1, y 3 0 The inequality of y 3 0 as generated for case 4 and another cut with
45 The other cases can be solved as follows. Case 3: case maximal vectors inequalities of the feasible set 3 (1, 0, 0), (0, 1, 0) y 1 + y 2 1, y 3 0 The inequality of y 3 0 as generated for case 4 and another cut with λ 0 = 1 b, λ 1 = 1 a 1 b, λ 2 = 1 a 2 b, λ 3 = 0, λ 4 = 0, λ 5 = 0, λ 6 = a 3 b.
46 case maximal vectors inequality of the feasible set 7 (1, 1, 0), (1, 0, 1) y 2 + y 3 1
47 case maximal vectors inequality of the feasible set 7 (1, 1, 0), (1, 0, 1) y 2 + y 3 1 λ 0 = 1, λ b 1 = 0, λ 2 = 1 a 2, λ b 3 = 1 a 3 λ 4 = a 1, λ b 5 = 0, λ 6 = 0. b,
48 case maximal vectors inequality of the feasible set 7 (1, 1, 0), (1, 0, 1) y 2 + y 3 1 λ 0 = 1, λ b 1 = 0, λ 2 = 1 a 2, λ b 3 = 1 a 3 λ 4 = a 1, λ b 5 = 0, λ 6 = 0. b, case maximal vectors inequality of the feasible set 8 (1, 1, 0), (1, 0, 1), (0, 1, 1) y 1 + y 2 + y 3 2
49 case maximal vectors inequality of the feasible set 7 (1, 1, 0), (1, 0, 1) y 2 + y 3 1 λ 0 = 1, λ b 1 = 0, λ 2 = 1 a 2, λ b 3 = 1 a 3 λ 4 = a 1, λ b 5 = 0, λ 6 = 0. b, case maximal vectors inequality of the feasible set 8 (1, 1, 0), (1, 0, 1), (0, 1, 1) y 1 + y 2 + y 3 2 λ 0 = 1 b, λ 1 = 1 a 1 b, λ 2 = 1 a 2 b, λ 3 = 1 a 3 b, λ 4 = 0, λ 5 = 0, λ 6 = 0.
50 case maximal vectors inequalities of the feasible set 6 (0, 0, 1), (1, 1, 0) y 1 + y 3 1, y 2 + y 3 1
51 case maximal vectors inequalities of the feasible set 6 (0, 0, 1), (1, 1, 0) y 1 + y 3 1, y 2 + y 3 1 The cut of case 8 and another cut with λ 0 = 1, λ b 1 = 1 a 1, λ b 2 = 0, λ 3 = 1 a 3 λ 4 = 0, λ 5 = a 2, λ b 6 = 0. b,
52 case maximal vectors inequalities of the feasible set 6 (0, 0, 1), (1, 1, 0) y 1 + y 3 1, y 2 + y 3 1 The cut of case 8 and another cut with λ 0 = 1, λ b 1 = 1 a 1, λ b 2 = 0, λ 3 = 1 a 3 λ 4 = 0, λ 5 = a 2, λ b 6 = 0. b, case maximal vectors inequality of the feasible set 5 (1, 0, 0), (0, 1, 0), (0, 0, 1) y 1 + y 2 + y 3 1
53 case maximal vectors inequalities of the feasible set 6 (0, 0, 1), (1, 1, 0) y 1 + y 3 1, y 2 + y 3 1 The cut of case 8 and another cut with λ 0 = 1, λ b 1 = 1 a 1, λ b 2 = 0, λ 3 = 1 a 3 λ 4 = 0, λ 5 = a 2, λ b 6 = 0. b, case maximal vectors inequality of the feasible set 5 (1, 0, 0), (0, 1, 0), (0, 0, 1) y 1 + y 2 + y 3 1 λ 0 = 1 a 2, λ 1 = 1 a 1 a 2, λ 2 = 0, λ 3 = 0, λ 4 = 0, λ 5 = 0, λ 6 = a 3 a 2 1.
54 4 A Counterexample in Dimension 4
55 4 A Counterexample in Dimension 4 12x x x x 4 53
56 4 A Counterexample in Dimension 4 12x x x x 4 53 The set of maximal feasible solutions:
57 4 A Counterexample in Dimension 4 12x x x x 4 53 The set of maximal feasible solutions: (1, 1, 1, 0), (0, 0, 1, 1), (0, 1, 0, 1), (1, 0, 0, 1)
58 4 A Counterexample in Dimension 4 12x x x x 4 53 The set of maximal feasible solutions: (1, 1, 1, 0), (0, 0, 1, 1), (0, 1, 0, 1), (1, 0, 0, 1) The hyperplane y 1 + y 2 + y 3 + 2y 4 = 3 contains all of these maximal feasible points.
59 4 A Counterexample in Dimension 4 12x x x x 4 53 The set of maximal feasible solutions: (1, 1, 1, 0), (0, 0, 1, 1), (0, 1, 0, 1), (1, 0, 0, 1) The hyperplane y 1 + y 2 + y 3 + 2y 4 = 3 contains all of these maximal feasible points. Therefore y 1 + y 2 + y 3 + 2y 4 3 is a valid cut of the integer hull.
60 4.1 Linear constraints for the generation of the cut 12λ 0 + λ 1 λ 5 = 1 12λ 0 + λ 2 λ 6 = 1 14λ 0 + λ 3 λ 7 = 1 30λ 0 + λ 4 λ 8 = 2 53λ 0 + λ 1 + λ 2 + λ 3 + λ 4 < 4
61 4.2 LP formulation min 53λ 0 + λ 1 + λ 2 + λ 3 + λ 4 12λ 0 + λ 1 λ 5 = 1 12λ 0 + λ 2 λ 6 = 1 14λ 0 + λ 3 λ 7 = 1 30λ 0 + λ 4 λ 8 = 2 λ 0,... λ 8 0
62 The optimal solution is:
63 The optimal solution is: λ 0 = 1 15, λ 1 = λ 2 = 1 5, λ 3 = 1 15, λ 4 = λ 5 = λ 6 = λ 7 = λ 8 = 0.
64 The optimal solution is: λ 0 = 1 15, λ 1 = λ 2 = 1 5, λ 3 = 1 15, λ 4 = λ 5 = λ 6 = λ 7 = λ 8 = 0. The optimal objective function value is 4.
65 The optimal solution is: λ 0 = 1 15, λ 1 = λ 2 = 1 5, λ 3 = 1 15, λ 4 = λ 5 = λ 6 = λ 7 = λ 8 = 0. The optimal objective function value is 4. Thus the cut does not exist in the rst Chvátal iteration.
66 The optimal solution is: λ 0 = 1 15, λ 1 = λ 2 = 1 5, λ 3 = 1 15, λ 4 = λ 5 = λ 6 = λ 7 = λ 8 = 0. The optimal objective function value is 4. Thus the cut does not exist in the rst Chvátal iteration. In general there are 27 dierent sets of maximal feasible solutions in dimension 4 if inequality (4) is satised.
67 10 (1,0,0,0), (0,1,0,0), (0,0,1,0), (0,0,0,1) y1 + y2 + y3 + y (0,0,1,0), (0,0,0,1), (1,1,0,0) y1 + y3 + y4 1, y2 + y3 + y (0,0,0,1), (1,1,0,0), (1,0,1,0) y1 + y2 + y3 + 2y4 2, y2 + y3 + y (0,0,0,1), (1,1,0,0), (1,0,1,0), (0,1,1,0) y1 + y2 + y3 + 2y (0,0,0,1), (1,1,1,0) y1 + y4 1, y2 + y4 1, y3 + y (1,1,0,0), (1,0,1,0), (1,0,0,1) y2 + y3 + y (1,1,0,0), (1,0,1,0), (0,1,1,0), (1,0,0,1) y1 + y2 + y3 + y4 2, y2 + y4 1, y3 + y (1,0,0,1), (1,1,1,0) y2 + y4 1, y3 + y (1,1,0,0), (1,0,1,0), (0,1,1,0), (1,0,0,1), (0,1,0,1) y1 + y2 + y3 + y4 2, y3 + y (1,0,0,1), (0,1,0,1), (1,1,1,0) y1 + y2 + y4 2, y3 + y (1,1,1,0), (1,1,0,1) y3 + y (1,1,0,0), (1,0,1,0), (0,1,1,0) and y1 + y2 + y3 + y4 2 (1,0,0,1), (0,1,0,1), (0,0,1,1) 22 (1,0,0,1), (0,1,0,1), (0,0,1,1), (1,1,1,0) y1 + y2 + y3 + 2y (0,0,1,1), (1,1,0,1) y1 + y3 + y4 2, y2 + y3 + y (0,1,0,1), (1,1,1,0), (1,0,1,1) y1 + y2 + y4 2, y2 + y3 + y (1,1,1,0), (1,1,0,1), (1,0,1,1) y2 + y3 + y (1,1,1,0), (1,1,0,1), (1,0,1,1), (0,1,1,1) y1 + y2 + y3 + y (1,1,1,1) 0 y i 1 ß = 1, 2, 3, 4
68 As it can be seen from Table the above example belongs to case 22.
69 As it can be seen from Table the above example belongs to case 22. Maximal vectors: (1, 0, 0, 1), (0, 1, 0, 1), (0, 0, 1, 1), (1, 1, 1, 0).
70 As it can be seen from Table the above example belongs to case 22. Maximal vectors: (1, 0, 0, 1), (0, 1, 0, 1), (0, 0, 1, 1), (1, 1, 1, 0). Inequality of the feasible set: y 1 + y 2 + y 3 + 2y 4 3.
71 As it can be seen from Table the above example belongs to case 22. Maximal vectors: (1, 0, 0, 1), (0, 1, 0, 1), (0, 0, 1, 1), (1, 1, 1, 0). Inequality of the feasible set: y 1 + y 2 + y 3 + 2y 4 3. All other cases have Chvátal rank 1.
72 Theorem The Chvátal rank of case 22 is higher than 1 if and only if a 1 + a 2 + a 3 a 3 + a 4 b b a 1 + a 2 + a 4 > b a 3 < a 4 2 a 1 + a 2 + a 3 + a 4 2 b
73 5 The [Dahl-Foldnes 2003] Knapsack Problem Polytope
74 5 The [Dahl-Foldnes 2003] Knapsack Problem Polytope x x m1 + px m px m1 +m 2 b. (5)
75 5 The [Dahl-Foldnes 2003] Knapsack Problem Polytope x x m1 + px m px m1 +m 2 b. (5) Let T = {m 1 + 1,..., m 1 + m 2 } and S {1, 2,..., m 1 }
76 5 The [Dahl-Foldnes 2003] Knapsack Problem Polytope x x m1 + px m px m1 +m 2 b. (5) Let T = {m 1 + 1,..., m 1 + m 2 } and S {1, 2,..., m 1 } and s = S, and 1 q < p.
77 Then h(s, q) = df max{x(s) + qx(t ) : x F }
78 Then h(s, q) = df max{x(s) + qx(t ) : x F } = b if s b
79 Then h(s, q) = df max{x(s) + qx(t ) : x F } = b max{s + q b s p, b (p q) b s p if s b } if b > s
80 Among the last m 2 variables at most { } l max = min m 2, can have value 1 in b p any feasible solution.
81 Theorem [Dahl-Foldnes 2003] (A) The integer hull of the knapsack problem is described by the following system of inequalities: (5), x(t ) l max, x(s) + qx(t ) h(s, q), S : S {1, 2,..., m 1 } and q : 1 q < p, 0 x i 1, i {1, 2,..., m 1 + m 2 }.
82 (B) The inequality x(s) + qx(t ) h(s, q) denes a facet of the integer hull if and only if (s > q or s = q = 1) and s {q + b p, q + b 2p,..., q + b pl max }.
83 5.1 The case m 2 = 1 Assumption p b = l max = 1.
84 5.1 The case m 2 = 1 Assumption p b = l max = 1. The above theorem implies that for each q > 1 the only value of s giving a facet of the integer hull is s = q + b p. (6) Hence it follows that h(s, q) = s.
85 5.1 The case m 2 = 1 Assumption p b = l max = 1. The above theorem implies that for each q > 1 the only value of s giving a facet of the integer hull is s = q + b p. (6) Hence it follows that h(s, q) = s. When has a facet with parameters satisfying (6) a Chvátal rank 1?
86 The LP model of the best cut of this type in the rst Chvátal iteration: min bλ 0 + λ 1 + λ λ m1 +1 λ 0 + λ 1 λ m1 +2 = 1 λ 0 + λ s λ m1 +s+1 = 1 λ 0 + λ s+1 λ m1 +s+2 = 0 λ 0 + λ m1 λ 2m1 +1 = 0 pλ 0 + λ m1 +1 λ 2m1 +2 = q λ 0,... λ 2m
87 The Path of the Simplex Method The variables λ 1,... λ m1 +1 form a feasible basis. λ 0 λ 1 λ s λ m1 +1 λ m1 +2 λ 2m1 +2 RHS λ λ s λ s λ m λ m1 +1 p 1 1 q OBF b m 1 p q s
88 Case b m 1 + p.
89 Case b m 1 + p. The integer hull is the unit cube.
90 Case b m 1 + p. The integer hull is the unit cube. The inequalities x(s) + qx(t ) h(s, q) are not facet dening.
91 Case b m 1 + p. The integer hull is the unit cube. The inequalities x(s) + qx(t ) h(s, q) are not facet dening. The Chvátal rank is 0. The simplex tableau is optimal.
92 Case m 1 + p > b and m 1 > s.
93 Case m 1 + p > b and m 1 > s. Variable λ 0 enters and any of the variables λ s+1,..., λ m1 may leave the basis.
94 Case m 1 + p > b and m 1 > s. Variable λ 0 enters and any of the variables λ s+1,..., λ m1 may leave the basis. After the interchange λ 0 λ s+1 the simplex tableau is this: λ0 λ1 λ s λ s+1 λ m1+1 λ m1+2 λ2m 1+2 RHS λ λ s λ λ s λ m λ m1+1 0 p 1 p 1 q OBF b + m1 + p b + 1 m1 p q s
95 The current basis is optimal if and only if m 1 = s, q = 1.
96 The current basis is optimal if and only if m 1 = s, q = 1. It implies that b + 1 = m 1 + p.
97 The current basis is optimal if and only if m 1 = s, q = 1. It implies that b + 1 = m 1 + p. Then this case is a generalization of case 26 in Dimension 4.
98 The current basis is optimal if and only if m 1 = s, q = 1. It implies that b + 1 = m 1 + p. Then this case is a generalization of case 26 in Dimension 4. Hence the only inequality what must be generated to obtain the integer hull m is 1 +1 j=1 x j m 1.
99 It can be generated by the following weights: λ 0 = 1 p, λ 1 = = λ m1 = p 1 p, λ m1 +1 = = λ 2m1 +2 = 0.
100 It can be generated by the following weights: λ 0 = 1 p, λ 1 = = λ m1 = p 1 p, λ m1 +1 = = λ 2m1 +2 = 0. The case of non-optimality.
101 It can be generated by the following weights: λ 0 = 1 p, λ 1 = = λ m1 = p 1 p, λ m1 +1 = = λ 2m1 +2 = 0. The case of non-optimality. The sequence of entering variables is λ m1 +s+2, λ m1 +s+3,..., λ 2m1, λ 2m1 +1.
102 At this moment the simplex tableau is as follows:
103 At this moment the simplex tableau is as follows: λ 0 λ 1 λ s λ m1 +1 λ 2m1 +2 RHS λ p λ s p p 1 λ 0 1 p 1 p 1 λ m1 +s p p λ 2m1 0 1 OBF p 1 p 1 1 p q p q p 1 q p 1 q p q p q p q p q 2 q s p
104 At this moment the simplex tableau is as follows: λ 0 λ 1 λ s λ m1 +1 λ 2m1 +2 RHS λ p λ s p p 1 λ 0 1 p 1 p 1 λ m1 +s p p λ 2m1 0 1 OBF p 1 p 1 1 p q p q p This is the optimal simplex tableau. 1 q p 1 q p q p q p q p q 2 q s p
105 The optimal objective function value is q2 p + q + s.
106 The optimal objective function value is q2 p + q + s. Thus the Chvátal rank of the facet dening cut is 1 if and only if q2 p + q + s < h(s, q) + 1 = s + 1.
107 The optimal objective function value is q2 p + q + s. Thus the Chvátal rank of the facet dening cut is 1 if and only if q2 p + q + s < h(s, q) + 1 = s + 1. This is equivalent to the inequality q 2 pq + p > 0. (7)
108 If m 1 + p > b and s = m 1 then we obtain the same inequality.
109 If m 1 + p > b and s = m 1 then we obtain the same inequality. Lemma Let m 1, p, and b be positive integers such that m 1 + p > b + 1. Then the Chvátal rank of the integer hull of the set { x IR m 1+1 x x m1 + px m1 +1 b; 0 x i 1, i = 1,..., m 1 } (8) is 1 if and only if no positive integer q with q < p exists such that (7) is violated.
110 Theorem Let m 1, p, and b be positive integers such that m 1 + p > b + 1 and p 4. Then the Chvátal rank of the integer hull of the set (8) is at least 2.
111 Theorem Let m 1, p, and b be positive integers such that m 1 + p > b + 1 and p 4. Then the Chvátal rank of the integer hull of the set (8) is at least 2. The main content of the theorem is that although the set dened in (8) has one of the simplest denitions among the sets of binary vectors, its Chvátal rank is still large.
112 An upper bound of the Chvátal rank
113 An upper bound of the Chvátal rank Iterative step:
114 An upper bound of the Chvátal rank Iterative step: Assumption: The facet dening cuts for q = i and q = p i, where i < p, are exiting 2 and have been already generated.
115 An upper bound of the Chvátal rank Iterative step: Assumption: The facet dening cuts for q = i and q = p i, where i < p, are exiting 2 and have been already generated. Case q = i + 1.
116 An upper bound of the Chvátal rank Iterative step: Assumption: The facet dening cuts for q = i and q = p i, where i < p, are exiting 2 and have been already generated. Case q = i + 1. We got a facet dening inequality if s = b p + i + 1. For the sake of simplicity assume that S = {1,..., s}.
117 The inequality for (s, q) =
118 The inequality for (s, q) = u the inequalities for (s 1, q 1)+
119 The inequality for (s, q) = u the inequalities for (s 1, q 1)+ +v (the inequality for (b i, p i)+ + b i j=s+1 ( x j 0)),
120 The inequality for (s, q) = u the inequalities for (s 1, q 1)+ where +v (the inequality for (b i, p i)+ u = + b i j=s+1 ( x j 0)), p 2i 1 (s 1)(p 2i) i, v = s i 1 (s 1)(p 2i) i.
121 Case q = p i 1, s = b i 1.
122 Case q = p i 1, s = b i 1. Assume that S = {1,..., b i 1}.
123 Case q = p i 1, s = b i 1. Assume that S = {1,..., b i 1}. The inequality for (s, q) =
124 Case q = p i 1, s = b i 1. Assume that S = {1,..., b i 1}. The inequality for (s, q) = u the inequalities for (b p + i, i)+
125 Case q = p i 1, s = b i 1. Assume that S = {1,..., b i 1}. The inequality for (s, q) = u the inequalities for (b p + i, i)+ +v (the inequality for (b i, p i)+ +( x b i 0))
126 Case q = p i 1, s = b i 1. Assume that S = {1,..., b i 1}. The inequality for (s, q) = u the inequalities for (b p + i, i)+ where u = +v (the inequality for (b i, p i)+ ( b i 2 b p+i 1 +( x b i 0)) 1 ) ( ), v = 1 p i b i 1 b p+i i 1 p i. b i 1 b p+i i
127 Initial step.
128 Initial step. The inequality of q = 1 and s = b p + 1 is x x m1 + (p 1)x m1 +1 b 1. (9)
129 Initial step. The inequality of q = 1 and s = b p + 1 is x x m1 + (p 1)x m1 +1 b 1. (9) (9) can be generated by the following multipliers: λ 0 = p 1 p, λ 1 = λ 2 = = λ m1 = 1 p, λ m1 +1 = = λ 2m1 +2 = 0.
130 These results can be summarize in the following statement.
131 These results can be summarize in the following statement. Theorem Let m 1, p, and b be positive integers such that m 1 + p > b + 1 and p 4. Then the Chvátal rank of the integer hull of the set (8) is at most p. 2
132 Chvátal, V., Edmonds polytopes and a hierarchy of combinatorial problems, Discrete Math, 4(1973), Dahl, G., Foldnes, N., Complete description of a class of knapsack polytopes, Operations Research Letters, 31(2003), Schrijver, A., The Theory of Linear and Integer Programming, J. Wiley & Sons, Chichester, 1986.
On the Chvatál-Complexity of Knapsack Problems
R u t c o r Research R e o r t On the Chvatál-Comlexity of Knasack Problems Gergely Kovács a Béla Vizvári b RRR 5-08, October 008 RUTCOR Rutgers Center for Oerations Research Rutgers University 640 Bartholomew
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 informationCO350 Linear Programming Chapter 8: Degeneracy and Finite Termination
CO350 Linear Programming Chapter 8: Degeneracy and Finite Termination 22th June 2005 Chapter 8: Finite Termination Recap On Monday, we established In the absence of degeneracy, the simplex method will
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 informationAM 121: Intro to Optimization! Models and Methods! Fall 2018!
AM 121: Intro to Optimization Models and Methods Fall 2018 Lecture 15: Cutting plane methods Yiling Chen SEAS Lesson Plan Cut generation and the separation problem Cutting plane methods Chvatal-Gomory
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.8 Strong valid inequalities
3.8 Strong valid inequalities By studying the problem structure, we can derive strong valid inequalities which lead to better approximations of the ideal formulation conv(x ) and hence to tighter bounds.
More informationOn the knapsack closure of 0-1 Integer Linear Programs. Matteo Fischetti University of Padova, Italy
On the knapsack closure of 0-1 Integer Linear Programs Matteo Fischetti University of Padova, Italy matteo.fischetti@unipd.it Andrea Lodi University of Bologna, Italy alodi@deis.unibo.it Aussois, January
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 informationCutting planes from two rows of simplex tableau
Cutting planes from two rows of simplex tableau Based on talk by Andersen et al, IPCO-2007 Ashutosh Mahajan 1 1 Lehigh University Department of Industrial and Systems Engineering Cor@l Seminar Series -
More informationOptimization Methods in Management Science
Optimization Methods in Management Science MIT 15.05 Recitation 8 TAs: Giacomo Nannicini, Ebrahim Nasrabadi At the end of this recitation, students should be able to: 1. Derive Gomory cut from fractional
More information21. Solve the LP given in Exercise 19 using the big-m method discussed in Exercise 20.
Extra Problems for Chapter 3. Linear Programming Methods 20. (Big-M Method) An alternative to the two-phase method of finding an initial basic feasible solution by minimizing the sum of the artificial
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 informationA Lower Bound on the Split Rank of Intersection Cuts
A Lower Bound on the Split Rank of Intersection Cuts Santanu S. Dey H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology. 200 Outline Introduction: split rank,
More informationLift-and-Project Inequalities
Lift-and-Project Inequalities Q. Louveaux Abstract The lift-and-project technique is a systematic way to generate valid inequalities for a mixed binary program. The technique is interesting both on the
More 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 informationSection Notes 9. Midterm 2 Review. Applied Math / Engineering Sciences 121. Week of December 3, 2018
Section Notes 9 Midterm 2 Review Applied Math / Engineering Sciences 121 Week of December 3, 2018 The following list of topics is an overview of the material that was covered in the lectures and sections
More information1 date: February 23, 1998 le: papar1. coecient pivoting rule. a particular form of the simplex algorithm.
1 date: February 23, 1998 le: papar1 KLEE - MINTY EAMPLES FOR (LP) Abstract : The problem of determining the worst case behavior of the simplex algorithm remained an outstanding open problem for more than
More informationOptimization Exercise Set n. 4 :
Optimization Exercise Set n. 4 : Prepared by S. Coniglio and E. Amaldi translated by O. Jabali 2018/2019 1 4.1 Airport location In air transportation, usually there is not a direct connection between every
More informationMath Models of OR: Some Definitions
Math Models of OR: Some Definitions John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA September 2018 Mitchell Some Definitions 1 / 20 Active constraints Outline 1 Active constraints
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 informationPart 1. The Review of Linear Programming
In the name of God Part 1. The Review of Linear Programming 1.2. Spring 2010 Instructor: Dr. Masoud Yaghini Outline Introduction Basic Feasible Solutions Key to the Algebra of the The Simplex Algorithm
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 informationOn Counting Lattice Points and Chvátal-Gomory Cutting Planes
On Counting Lattice Points and Chvátal-Gomory Cutting Planes Andrea Lodi 1, Gilles Pesant 2, and Louis-Martin Rousseau 2 1 DEIS, Università di Bologna - andrea.lodi@unibo.it 2 CIRRELT, École Polytechnique
More informationOn the matrix-cut rank of polyhedra
On the matrix-cut rank of polyhedra William Cook and Sanjeeb Dash Computational and Applied Mathematics Rice University August 5, 00 Abstract Lovász and Schrijver (99) described a semi-definite operator
More information1 Column Generation and the Cutting Stock Problem
1 Column Generation and the Cutting Stock Problem In the linear programming approach to the traveling salesman problem we used the cutting plane approach. The cutting plane approach is appropriate when
More informationNotes on Dantzig-Wolfe decomposition and column generation
Notes on Dantzig-Wolfe decomposition and column generation Mette Gamst November 11, 2010 1 Introduction This note introduces an exact solution method for mathematical programming problems. The method is
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 informationMATHEMATICAL PROGRAMMING I
MATHEMATICAL PROGRAMMING I Books There is no single course text, but there are many useful books, some more mathematical, others written at a more applied level. A selection is as follows: Bazaraa, Jarvis
More informationCutting Plane Separators in SCIP
Cutting Plane Separators in SCIP Kati Wolter Zuse Institute Berlin DFG Research Center MATHEON Mathematics for key technologies 1 / 36 General Cutting Plane Method MIP min{c T x : x X MIP }, X MIP := {x
More informationRobust linear optimization under general norms
Operations Research Letters 3 (004) 50 56 Operations Research Letters www.elsevier.com/locate/dsw Robust linear optimization under general norms Dimitris Bertsimas a; ;, Dessislava Pachamanova b, Melvyn
More informationOptimization Exercise Set n.5 :
Optimization Exercise Set n.5 : Prepared by S. Coniglio translated by O. Jabali 2016/2017 1 5.1 Airport location In air transportation, usually there is not a direct connection between every pair of airports.
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 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 informationAnn-Brith Strömberg. Lecture 4 Linear and Integer Optimization with Applications 1/10
MVE165/MMG631 Linear and Integer Optimization with Applications Lecture 4 Linear programming: degeneracy; unbounded solution; infeasibility; starting solutions Ann-Brith Strömberg 2017 03 28 Lecture 4
More informationLinear programs Optimization Geoff Gordon Ryan Tibshirani
Linear programs 10-725 Optimization Geoff Gordon Ryan Tibshirani Review: LPs LPs: m constraints, n vars A: R m n b: R m c: R n x: R n ineq form [min or max] c T x s.t. Ax b m n std form [min or max] c
More informationconstraints Ax+Gy» b (thus any valid inequalityforp is of the form u(ax+gy)» ub for u 2 R m + ). In [13], Gomory introduced a family of valid inequali
On the Rank of Mixed 0,1 Polyhedra Λ Gérard Cornuéjols Yanjun Li Graduate School of Industrial Administration Carnegie Mellon University, Pittsburgh, USA (corresponding author: gc0v@andrew.cmu.edu) February
More informationLOWER BOUNDS FOR CHVÁTAL-GOMORY STYLE OPERATORS SEBASTIAN POKUTTA
LOWER BOUNDS FOR CHVÁTAL-GOMORY STYLE OPERATORS SEBASTIAN POKUTTA Friedrich-Alexander-University of Erlangen-Nürnberg Am Weichselgarten 9 91058 Erlangen Germany ABSTRACT. Valid inequalities or cutting
More informationPacking Arborescences
Egerváry Research Group on Combinatorial Optimization Technical reports TR-2009-04. Published by the Egerváry Research Group, Pázmány P. sétány 1/C, H1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.
More informationSplit closure and intersection cuts
Math. Program., Ser. A 102: 457 493 (2005) Digital Object Identifier (DOI) 10.1007/s10107-004-0558-z Kent Andersen Gérard Cornuéjols Yanjun Li Split closure and intersection cuts Received: February 4,
More informationReformulation of capacitated facility location problems: How redundant information can help. Karen Aardal. Utrecht University. P.O.
Reformulation of capacitated facility location problems: How redundant information can help Karen Aardal Department of Computer Science Utrecht University P.O. Box 80089 3508 TB Utrecht, The Netherlands
More informationTermination, Cycling, and Degeneracy
Chapter 4 Termination, Cycling, and Degeneracy We now deal first with the question, whether the simplex method terminates. The quick answer is no, if it is implemented in a careless way. Notice that we
More informationOperations Research Lecture 6: Integer Programming
Operations Research Lecture 6: Integer Programming Notes taken by Kaiquan Xu@Business School, Nanjing University May 12th 2016 1 Integer programming (IP) formulations The integer programming (IP) is the
More informationLift-and-Project Techniques and SDP Hierarchies
MFO seminar on Semidefinite Programming May 30, 2010 Typical combinatorial optimization problem: max c T x s.t. Ax b, x {0, 1} n P := {x R n Ax b} P I := conv(k {0, 1} n ) LP relaxation Integral polytope
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 informationNote 3: LP Duality. If the primal problem (P) in the canonical form is min Z = n (1) then the dual problem (D) in the canonical form is max W = m (2)
Note 3: LP Duality If the primal problem (P) in the canonical form is min Z = n j=1 c j x j s.t. nj=1 a ij x j b i i = 1, 2,..., m (1) x j 0 j = 1, 2,..., n, then the dual problem (D) in the canonical
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 information4. Duality and Sensitivity
4. Duality and Sensitivity For every instance of an LP, there is an associated LP known as the dual problem. The original problem is known as the primal problem. There are two de nitions of the dual pair
More informationA Stochastic Programming Based Analysis of the Field Use in a Farm
R u t c o r Research R e p o r t A Stochastic Programming Based Analysis of the Field Use in a Farm Béla Vizvári a Zsolt Csizmadia b Gergely Kovács c RRR 20-2007, June, 2007 RUTCOR Rutgers Center for Operations
More informationWeek 2. The Simplex method was developed by Dantzig in the late 40-ties.
1 The Simplex method Week 2 The Simplex method was developed by Dantzig in the late 40-ties. 1.1 The standard form The simplex method is a general description algorithm that solves any LPproblem instance.
More informationSummary of the simplex method
MVE165/MMG631,Linear and integer optimization with applications The simplex method: degeneracy; unbounded solutions; starting solutions; infeasibility; alternative optimal solutions Ann-Brith Strömberg
More informationIE 5531: Engineering Optimization I
IE 5531: Engineering Optimization I Lecture 15: Nonlinear optimization Prof. John Gunnar Carlsson November 1, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I November 1, 2010 1 / 24
More informationChapter 1. Preliminaries
Introduction This dissertation is a reading of chapter 4 in part I of the book : Integer and Combinatorial Optimization by George L. Nemhauser & Laurence A. Wolsey. The chapter elaborates links between
More 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 informationLecture #21. c T x Ax b. maximize subject to
COMPSCI 330: Design and Analysis of Algorithms 11/11/2014 Lecture #21 Lecturer: Debmalya Panigrahi Scribe: Samuel Haney 1 Overview In this lecture, we discuss linear programming. We first show that the
More informationSupplementary lecture notes on linear programming. We will present an algorithm to solve linear programs of the form. maximize.
Cornell University, Fall 2016 Supplementary lecture notes on linear programming CS 6820: Algorithms 26 Sep 28 Sep 1 The Simplex Method We will present an algorithm to solve linear programs of the form
More informationOn the Polyhedral Structure of a Multi Item Production Planning Model with Setup Times
CORE DISCUSSION PAPER 2000/52 On the Polyhedral Structure of a Multi Item Production Planning Model with Setup Times Andrew J. Miller 1, George L. Nemhauser 2, and Martin W.P. Savelsbergh 2 November 2000
More informationThe Simplex Method. Lecture 5 Standard and Canonical Forms and Setting up the Tableau. Lecture 5 Slide 1. FOMGT 353 Introduction to Management Science
The Simplex Method Lecture 5 Standard and Canonical Forms and Setting up the Tableau Lecture 5 Slide 1 The Simplex Method Formulate Constrained Maximization or Minimization Problem Convert to Standard
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 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 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 informationOn the separation of split cuts and related inequalities
Math. Program., Ser. B 94: 279 294 (2003) Digital Object Identifier (DOI) 10.1007/s10107-002-0320-3 Alberto Caprara Adam N. Letchford On the separation of split cuts and related inequalities Received:
More informationMATH 445/545 Homework 2: Due March 3rd, 2016
MATH 445/545 Homework 2: Due March 3rd, 216 Answer the following questions. Please include the question with the solution (write or type them out doing this will help you digest the problem). I do not
More informationStandard Form An LP is in standard form when: All variables are non-negativenegative All constraints are equalities Putting an LP formulation into sta
Chapter 4 Linear Programming: The Simplex Method An Overview of the Simplex Method Standard Form Tableau Form Setting Up the Initial Simplex Tableau Improving the Solution Calculating the Next Tableau
More informationOn the knapsack closure of 0-1 Integer Linear Programs
On the knapsack closure of 0-1 Integer Linear Programs Matteo Fischetti 1 Dipartimento di Ingegneria dell Informazione University of Padova Padova, Italy Andrea Lodi 2 Dipartimento di Elettronica, Informatica
More informationMidterm Review. Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A.
Midterm Review Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/ yyye (LY, Chapter 1-4, Appendices) 1 Separating hyperplane
More informationCarnegie Mellon University, Pittsburgh, USA. April Abstract
Elementary Closures for Integer Programs Gerard Cornuejols Yanjun Li Graduate School of Industrial Administration Carnegie Mellon University, Pittsburgh, USA April 2000 (revised October 2000) Abstract
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 8 Discrete optimization: theory and algorithms
MVE165/MMG631 Linear and integer optimization with applications Lecture 8 Discrete optimization: theory and algorithms Ann-Brith Strömberg 2017 04 07 Lecture 8 Linear and integer optimization with applications
More informationAsteroide Santana, Santanu S. Dey. December 4, School of Industrial and Systems Engineering, Georgia Institute of Technology
for Some for Asteroide Santana, Santanu S. Dey School of Industrial Systems Engineering, Georgia Institute of Technology December 4, 2016 1 / 38 1 1.1 Conic integer programs for Conic integer programs
More informationSystems Analysis in Construction
Systems Analysis in Construction CB312 Construction & Building Engineering Department- AASTMT by A h m e d E l h a k e e m & M o h a m e d S a i e d 3. Linear Programming Optimization Simplex Method 135
More informationPrelude to the Simplex Algorithm. The Algebraic Approach The search for extreme point solutions.
Prelude to the Simplex Algorithm The Algebraic Approach The search for extreme point solutions. 1 Linear Programming-1 x 2 12 8 (4,8) Max z = 6x 1 + 4x 2 Subj. to: x 1 + x 2
More informationUnderstanding the Simplex algorithm. Standard Optimization Problems.
Understanding the Simplex algorithm. Ma 162 Spring 2011 Ma 162 Spring 2011 February 28, 2011 Standard Optimization Problems. A standard maximization problem can be conveniently described in matrix form
More informationSpecial Classes of Fuzzy Integer Programming Models with All-Dierent Constraints
Transaction E: Industrial Engineering Vol. 16, No. 1, pp. 1{10 c Sharif University of Technology, June 2009 Special Classes of Fuzzy Integer Programming Models with All-Dierent Constraints Abstract. K.
More informationarxiv: v1 [cs.cc] 5 Dec 2018
Consistency for 0 1 Programming Danial Davarnia 1 and J. N. Hooker 2 1 Iowa state University davarnia@iastate.edu 2 Carnegie Mellon University jh38@andrew.cmu.edu arxiv:1812.02215v1 [cs.cc] 5 Dec 2018
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 informationR u t c o r Research R e p o r t. The Optimization of the Move of Robot Arm by Benders Decomposition. Zsolt Robotka a RRR , DECEMBER 2005
R u t c o r Research R e p o r t The Optimization of the Move of Robot Arm by Benders Decomposition Zsolt Robotka a Béla Vizvári b RRR 43-2005, DECEMBER 2005 RUTCOR Rutgers Center for Operations Research
More informationCutting Planes in SCIP
Cutting Planes in SCIP Kati Wolter Zuse-Institute Berlin Department Optimization Berlin, 6th June 2007 Outline 1 Cutting Planes in SCIP 2 Cutting Planes for the 0-1 Knapsack Problem 2.1 Cover Cuts 2.2
More informationLINEAR PROGRAMMING. Relation to the Text (cont.) Relation to Material in Text. Relation to the Text. Relation to the Text (cont.
LINEAR PROGRAMMING Relation to Material in Text After a brief introduction to linear programming on p. 3, Cornuejols and Tϋtϋncϋ give a theoretical discussion including duality, and the simplex solution
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 informationLecture 1. Toric Varieties: Basics
Lecture 1. Toric Varieties: Basics Taras Panov Lomonosov Moscow State University Summer School Current Developments in Geometry Novosibirsk, 27 August1 September 2018 Taras Panov (Moscow University) Lecture
More informationthat nds a basis which is optimal for both the primal and the dual problems, given
On Finding Primal- and Dual-Optimal Bases Nimrod Megiddo (revised June 1990) Abstract. We show that if there exists a strongly polynomial time algorithm that nds a basis which is optimal for both the primal
More informationProjected Chvátal-Gomory cuts for Mixed Integer Linear Programs. Pierre Bonami CMU, USA. Gerard Cornuéjols CMU, USA and LIF Marseille, France
Projected Chvátal-Gomory cuts for Mixed Integer Linear Programs Pierre Bonami CMU, USA Gerard Cornuéjols CMU, USA and LIF Marseille, France Sanjeeb Dash IBM T.J. Watson, USA Matteo Fischetti University
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 informationFacets for Node-Capacitated Multicut Polytopes from Path-Block Cycles with Two Common Nodes
Facets for Node-Capacitated Multicut Polytopes from Path-Block Cycles with Two Common Nodes Michael M. Sørensen July 2016 Abstract Path-block-cycle inequalities are valid, and sometimes facet-defining,
More informationDEPARTMENT OF STATISTICS AND OPERATIONS RESEARCH OPERATIONS RESEARCH DETERMINISTIC QUALIFYING EXAMINATION. Part I: Short Questions
DEPARTMENT OF STATISTICS AND OPERATIONS RESEARCH OPERATIONS RESEARCH DETERMINISTIC QUALIFYING EXAMINATION Part I: Short Questions August 12, 2008 9:00 am - 12 pm General Instructions This examination is
More informationA Redundant Klee-Minty Construction with All the Redundant Constraints Touching the Feasible Region
A Redundant Klee-Minty Construction with All the Redundant Constraints Touching the Feasible Region Eissa Nematollahi Tamás Terlaky January 5, 2008 Abstract By introducing some redundant Klee-Minty constructions,
More informationNon-TDI graph-optimization with supermodular functions (extended abstract)
Egerváry Research Group on Combinatorial Optimization Technical reports TR-2015-14. Published by the Egerváry Research Group, Pázmány P. sétány 1/C, H1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.
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 informationA packing integer program arising in two-layer network design
A packing integer program arising in two-layer network design Christian Raack Arie M.C.A Koster Zuse Institute Berlin Takustr. 7, D-14195 Berlin Centre for Discrete Mathematics and its Applications (DIMAP)
More informationChapter 5 Linear Programming (LP)
Chapter 5 Linear Programming (LP) General constrained optimization problem: minimize f(x) subject to x R n is called the constraint set or feasible set. any point x is called a feasible point We consider
More information58 Appendix 1 fundamental inconsistent equation (1) can be obtained as a linear combination of the two equations in (2). This clearly implies that the
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 information1 Matroid intersection
CS 369P: Polyhedral techniques in combinatorial optimization Instructor: Jan Vondrák Lecture date: October 21st, 2010 Scribe: Bernd Bandemer 1 Matroid intersection Given two matroids M 1 = (E, I 1 ) and
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 informationSlack Variable. Max Z= 3x 1 + 4x 2 + 5X 3. Subject to: X 1 + X 2 + X x 1 + 4x 2 + X X 1 + X 2 + 4X 3 10 X 1 0, X 2 0, X 3 0
Simplex Method Slack Variable Max Z= 3x 1 + 4x 2 + 5X 3 Subject to: X 1 + X 2 + X 3 20 3x 1 + 4x 2 + X 3 15 2X 1 + X 2 + 4X 3 10 X 1 0, X 2 0, X 3 0 Standard Form Max Z= 3x 1 +4x 2 +5X 3 + 0S 1 + 0S 2
More informationNecessary and Sufficient Conditions for Reachability on a Simplex
Necessary and Sufficient Conditions for Reachability on a Simplex Bartek Roszak a, Mireille E. Broucke a a Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University of Toronto,
More information1 Review Session. 1.1 Lecture 2
1 Review Session Note: The following lists give an overview of the material that was covered in the lectures and sections. Your TF will go through these lists. If anything is unclear or you have questions
More informationThe Strength of Multi-row Aggregation Cuts for Sign-pattern Integer Programs
The Strength of Multi-row Aggregation Cuts for Sign-pattern Integer Programs Santanu S. Dey 1, Andres Iroume 1, and Guanyi Wang 1 1 School of Industrial and Systems Engineering, Georgia Institute of Technology
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 informationInteger Programming: Cutting Planes
OptIntro 1 / 39 Integer Programming: Cutting Planes Eduardo Camponogara Department of Automation and Systems Engineering Federal University of Santa Catarina October 2016 OptIntro 2 / 39 Summary Introduction
More informationInteger and Combinatorial Optimization: The Cut Generation LP
Integer and Combinatorial Optimization: The Cut Generation LP John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA March 2019 Mitchell The Cut Generation LP 1 / 15 General disjunctions
More information