Consider the following linear program: Max 1A - 2B s.t. -4A + 3B 3 1A -

Question:

Consider the following linear program:
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?