Solve the LP problem. If no optimal solution exists, indicate whether the feasible region is empty or the objective function is unbounded. (Enter EMPTY if the region is empty. Enter UNBOUNDED if the function is unbounded.)

Minimize c = 2x + 4y subject to

• 0.6x + 0.6y 6
• 4x + 8y 56
• x 0, y 0.

Minimum value c =

occurs at the endpoints (x, y) =

(smaller x-value) and (x, y) =

(larger x-value) and ---Select--- the function is unbounded the region is empty no other points the line connecting them .