Self Test Questions
Theory
1. What do you understand by integer programming problem?
2. Discuss the need of integer programming.
Practical
1. Maximize z = 7x1 + 9x2
subject to
-x1 + 3x2 ≤ 6
7x1 + x2 ≤ 35
where x1, x2 are integers ≥ 0
2. Maximize z = x1 + 2x2
subject to
2x2 ≤ 7
x1 + x2 ≤ 7
2x1 ≤ 11
where x1, x2 are integers ≥ 0
3. Maximize z = 2x1 + 6x2
subject to
3x1 + x2 ≤ 5
4x1 + 4x2 ≤ 9
where x1, x2 are integers ≥ 0
4. Solve the following by Branch & Bound method
Maximize z = 5x1 + 9x2
subject to
-x1 + 5x2 ≤ 3
5x1 + 3x2 ≤ 27
where x1, x2 are non negative integers
