288 Optimization: Algorithms and Applications
Minimize 16x
1
+ 15x
2
+ 17x
3
+ 15x
4
+ 40x
5
+ 12x
6
+ 13x
7
+ 9x
8
+
12x
9
subject to 13x
1
+ 50x
2
+ 7x
3
+ 6x
4
+ 36x
5
+ 6x
6
+ 46x
7
+ 38x
8
+
18x
9
≤ 50
3x
1
+ 8x
2
+ 6x
3
+ 2x
4
+ 34x
5
+ 6x
6
+ 4x
7
+ 7x
8
+ 3x
9
≤
20
x ∈ {0, 1}
5. Solve the following integer programming problem using Gomory’s
cutting plane method.
Minimize f(x) = −3x
1
− 5x
2
subject to 2x
1
+ 5x
2
≤ 15
2x
1
− 2x
2
≤ 5
x
1
, x
2
≥ 0
where x
1
and x
2
are integers.
6. Solve the following integer programming problem using Gomory’s
cutting plane method.
Minimize f(x) = −4x
1
− 7x
2
subject to x
1
+ x
2
≤ 6
5x
1
+ 9x
2
≤ 50
x
1
, x
2
≥ 0
where x
1
and x
2
are integers.
7. Solve the following in