Answer Happy

Posted: **Thu May 05, 2022 6:55 pm**

: Consider The Following Pure Integer Programming Problem Minimize Z 2 Subject To 1 X 1 21 22 1 220 And Integral 1 (54.46 KiB) Viewed 37 times

: Consider The Following Pure Integer Programming Problem Minimize Z 2 Subject To 1 X 1 21 22 1 220 And Integral 2 (56.43 KiB) Viewed 37 times

Consider the following pure integer programming problem Minimize z=-2 subject to -1 + x₂ ≤1 21 +22 #1, #220 and integral. Solve it with LP Assistant, neglecting the integral constraints, and adding slack variables 23, 24 we get the following final tableau: #1 X2 I3 X4 X2 0 1 1/2 1/2 3/2 #1 1 0 -1/2 1/2 1/2 0 0 1/2 1/2 3/2 We see that the min value -3/2 is obtained at x2 = 1.5, 1 = 0.5. Perform the cutting plane algorithm, using the second row.
21, 2220 and integral. Solve it with LP Assistant, neglecting the integral constraints, and adding slack variables #3, #4 we get the following final tableau: F1 Τη x3 CA X2 0 1 1/2 1/2 3/2 21 1 0 -1/2 1/2 1/2 0 0 1/2 1/2 3/2 We see that the min value -3/2 is obtained at x2 = 1.5, 10.5. Perform the cutting plane algorithm, using the second row. (i) Write out the new constraint; (ii) Set up the new tableau; (iii) Illustrate graphically how the new constraint cuts the feasible region; (iv) Find the optimal solution on the graph.