Consider the following linear program. Max 1A - 2B s.t. -4A + 3B S 3 1A - 1B S 4 AB 20 (a) Graph the feasible region for the problem. 15 15 15 10 10 10 10 5 5 S A 214 0 10 12 14 6 8 10 12 14 10 12 14 2 10 12 14 (b) Is the feasible region unbounded? Explain. The feasible region is unbounded because the value of the solution may be made infinitely large without violating any of the constraints. The feasible region is unbounded because more than one optimal solution occurs without violating any of the constraints. The feasible region is unbounded because the solution coordinates may be made infinitely large without violating any of the constraints. The feasible region is unbounded because the value of the solution violates at least one of the constraints. The feasible region is not unbounded. (c) Find the optimal solution. (A,B) - (d) Does an unbounded feasible region imply that the optimal solution to the linear program will be unbounded? Yes No