7. [-/7.14 Points] DETAILS MY NOTES Solve the LP problem. If no optimal solution exists because there is no Solution Set, enter EMPTY. If no optimal solution exists because the region is unbounded, enter UNBOUNDED. Note that an unbounded region can still have an optimal solution while a bounded region is guaranteed to have optimal solutions. HINT [See Example 1.] Minimize c = x + 2y subject to x + 5y 2 21 3x + yz 21 x20, y 20. C = ( x, y ) =% 6.1/62 - Linear Programmln 1" , i i' i ++e_em-- P"_'"\\ I SubmitAnswer 8. [-I7.14 Points] Solve the LP problem. If no optimal solution exists because there is no Solution Set, enter EMPTY. If no optimal solution exists because the region is unbounded, enter UNBOUNDED. Note that an unbounded region can still have an optimal solution while a bounded region is guaranteed to have optimal solutions. HINT [See Example 1.] Maximize and minimize p = x + 2y subject to x+y22 x+ys8 xySZ xyaZ WMmum: (x,y)=( ) Maximum: ,7 = (x, y) =( ) 9. {-17.14 Points] Solve the LP problem. If no optimal solution exists because there is no Solution Set, enter EMPTY. If no optimal solution exists because the region is unbounded, enter UNBOUNDED unbounded region can still have an optimal solution while a bounded region is guaranteed to have optimal solutions. HINT [See Example 1.] MMMmc=xymwmuo X