OR- Assignment (Lab-8)
Write code to solve the following Integer programming problem by cutting plane method of Gomory. Print the input, solutions and optimized value. Your output must have all the tables. Submit your code and output file for each question separately.
1. Min Z = 2x1 + 15x2 + 18x3 subject to
−x1 + 2x2 − 6x3 ≤−10 x2 + 2x3 ≤ 6
2x1 + 10x3 ≤ 19 −x1 + x2 ≤−2 x1,x2,x3 ≥ 0.
2. Max Z = 3x1 + 4x2 subject to
3x1 − x2 ≤ 12
3x1 + 11x2 ≤ 66 x1,x2 ≥ 0.
3. Max Z = x1 + x2 subject to
2x2 ≤ 7 x1 + x2 ≤ 7
2x1 ≤ 11 x1,x2 ≥ 0.
4. Max Z = 7x1 + 9x2 subject to
−x1 + 3x2 ≤ 6
7x1 + x2 ≤ 35 x1,x2 ≥ 0.
*****
