5. Show that, even though the following problem has a feasible integer solution in Xl and X2,...

Question:

5. Show that, even though the following problem has a feasible integer solution in Xl and X2, the fractional cut would not yield a feasible solution unless all the fractions in the constraint were eliminated.

Maximize z = Xl + 2X2 subject to Xl + ~X2 ::s ¥

X[,X2 ~ 0 and integer

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: