Show that, even though the following problem has a feasible integer solution in x1 and x2, the
Question:
Show that, even though the following problem has a feasible integer solution in x1 and x2, the fractional cut would not yield a feasible solution unless all the fractions in the constraint were eliminated.
Maximize z = x1 + 2x2 subject to x1 + 12 x2 … 13 4
x1, x2 Ú 0 and integer
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Question Posted: