Consider the following linear program. Max 1A 2B - s.t. -4A + 3B 3 1A 1B 4 A, B 0 (a) Graph the feasible region for the problem. B B 15 15 10 10 / 5 face A 2 4 6 8 10 12 14 2 4 6 8 10 12 14 2 4 6 8 O (b) Is the feasible region unbounded? Explain. O The feasible region is unbounded because the value of the solution may be made infinitely large without violating any of the constraints. O The feasible region is unbounded because more than one optimal solution occurs without violating any of the constraints. O The feasible region is unbounded because the value of the solution violates at least one of the constraints. O The feasible region is unbounded because the solution coordinates may be made infinitely large without violating any of the constraints. O 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? O Yes O No A B 15 10 P 10 12 14 A B 15 10 5 2 /4 6 8 10 12 14 A