QAM-III Course Instructor: Sonia

Problem Sheet 2: Integer Programming Problems

Q. 1 Solve the following problems by branch and bound method:

(a) max 4x1 + 8x2 + x3
subject to
x1 + 3x2 x3 8,
2x1 + 2x2 + x3 7,
x1 + 5x2 + 3x3 8,
x1 , x2 , x3 0 and integer.
(b) max 4x1 + 3x2
subject to
3x1 + 5x2 11,
4x1 + x2 8,
x1 0 and integer,
x2 0.
(c) max 9x1 + 10x2
subject to
2x1 + 5x2 15,
x1 3,
x1 , x2 0 and integers.
Q. 2 max 3x1 + 4x2
subject to
either x1 4 and x2 5
or x1 5 and x2 2
Formulate the mixed integer programming problem equivalent to the above problem.
Q. 3 Formulate the equivalent mixed integer program for the problem
max 5x1 + 6x2 + 2x3
where (x1 , x2 , x3 ) satisfies at most 2 of the following 4 constraints
x1 + 2x2 + x3 5
3x1 7x2 + x3 9
2x1 + 3x2 7x3 4
5x1 + 7x2 + 8x3 5
x1 , x2 , x3 0
Q. 4 Formulate the equivalent mixed integer program for the problem
max 3x1 + 7x2 + 5x3
subject to
2x1 + 5x2 + 6x3 4 or 11 or 17 or 35
5x1 + 9x2 3
x1 = 7 or 13 or 25
x2 0 and integer