Reference no: EM132332278
Integer Linear Programming
Question 1. Solve the following integer linear programming problem by using:
a) Branch and Bound Method
b) Fractional Cut Method.
Max Z = 3x1 + 4x2
Max Z = 3x1 + 4x2
S. t. 2x1 + x2 ≤ 6
2x1 + 3x2 ≤ 9
Χ1, Χ2 ≥ 0, and integers
Question 2. Solve the following integer linear problem by:
a) Branch and Bound Method
b) Fractional Cut Method.
Max Z = 4x1 + 6x2 + 2x3
s. t. 4x1 - 4x2 ≤ 5
-x1 + 6x2 ≤ 5
-x1 + x2 + x3 ≤ 5
x1, x2, x3 ≥ 0 and integers
Question 3. Solve the following integer linear problem by:
a) Branch and Bound Method
b) Fractional Cut Method.
Max Z = 3x1 + x2 + 3x3
s. t. - x1 + 2x2 + x3 ≤ 4
4x2 - 3x3 ≤ 2
x1 - 3x2 + 2x3 ≤ 3
x1, x2, x3 ≥ 0 and integers