Consider the following LP problem. MAX: 3X1 + 2X2 Subject to: 3X1 + 3X2 300 6X1

Question:

Consider the following LP problem.
MAX: 3X1 + 2X2
Subject to: 3X1 + 3X2 ≤ 300
6X1 + 3X2 ≤ 480
3X1 + 3X2 ≤ 480
X1, X2 ≥ 0

a. Sketch the feasible region for this model.
b. What is the optimal solution?
c. Identify any redundant constraints in this model.

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

Step by Step Answer:

Question Posted: