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.) Maximize p = 3x + y subject to 4x - 5y s0 5x - 4y 20 x + ys9 x 2 0, y 2 0. (х, у) %3

Rewrite the objective function into a maximization function. Minimize w = 2y1 + Y2 + 3y3 subject to: 3y, + 2y2 + y3 2 59 Y2 + y3 2 13 2y1 + y2 2 33 У120, У2 2 0, Уз 20 O A. Maximize z = 2x, + X2 + 3x3 - X4 О В. Махimize z %3D - х2 - Х3 24 O C. Maximize z = - 2x1 - X2 - 3x3 O D. Маximize z%3D - 2x1 -X, s 20

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.) Maximize p = 3x + 4y subject to −5x + y ≥ 9 x + 3y ≤ 11 x ≥ 0, y ≥ 0. p=(x, y) =

Solve the LP problem. If no optimal solution exists, indicate whether the feasible region is empty or the objective function is unbounded. HINT [See Example 1.] (Enter EMPTY if the region is empty. Enter UNBOUNDED if the function is unbounded.) Minimize c = x + y subject to X + 2y 2 9 2х + y> 9 X2 0, у 2 0. C = (х,у)