Consider the following linear program
Max 1A - 2B
s.t.
-4A +3B ≤ 3
1A - 1B ≤ 3
A,B ≥ 0
- Graph the feasible region for the problem.
- Is the feasible region unbounded? Explain.
- Find the optimal solution
- Does an unbounded feasible region imply that the optimal solution to the linear program will be unbounded?