Question: Consider the following linear program: Max 1A - 2B s.t. -4A + 3B 3 1A - 1B 3 A, B 0 a.
Max 1A - 2B
s.t.
-4A + 3B ≤ 3
1A - 1B ≤ 3
A, B ≥ 0
a. Graph the feasible region for the problem.
b. Is the feasible region unbounded? Explain.
c. Find the optimal solution.
d. Does an unbounded feasible region imply that the optimal solution to the linear program will be unbounded?
Step by Step Solution
3.29 Rating (167 Votes )
There are 3 Steps involved in it
a b Feasible region is unbounded c Optimal Solution A 3 B 0 z 3 d An unbou... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
148-M-O-G-L-P (58).docx
120 KBs Word File
