Question: Consider the following LP problem. MAX: 3X1 + 2X2 Subject to: 3X1 + 3X2 300 6X1 + 3X2 480 3X1 + 3X2
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.
Step by Step Solution
3.54 Rating (178 Votes )
There are 3 Steps involved in it
a b c X 200 150 100 50 0 0100 ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
167-B-M-L-M-D-A (32).docx
120 KBs Word File
