Description
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 = 2×1 + 15×2 + 18×3 subject to
−x1 + 2×2 − 6×3 ≤−10 x2 + 2×3 ≤ 6
2×1 + 10×3 ≤ 19 −x1 + x2 ≤−2 x1,x2,x3 ≥ 0.
2. Max Z = 3×1 + 4×2 subject to
3×1 − x2 ≤ 12
3×1 + 11×2 ≤ 66 x1,x2 ≥ 0.
3. Max Z = x1 + x2 subject to
2×2 ≤ 7 x1 + x2 ≤ 7
2×1 ≤ 11 x1,x2 ≥ 0.
4. Max Z = 7×1 + 9×2 subject to
−x1 + 3×2 ≤ 6
7×1 + x2 ≤ 35 x1,x2 ≥ 0.
*****
