Consider the following optimization problem: MAX: X1 + X2 Subject to: -4X1 + 4X2 1 -8X1

Question:

Consider the following optimization problem:

MAX: X1 + X2

Subject to:

-4X1 + 4X2 ≤ 1

-8X1 + 10X2 ≥ 15

X1, X2 ≥ 0

a. What is the optimal solution to the problem?

b. Now suppose that X1 and X2 must be integers. What is the optimal solution?

c. What general principle of integer programming is illustrated by this question?

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

Step by Step Answer:

Question Posted: