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 = 6x − 6y subject to x 5 ≤ y y ≤ 2x 7 x + y ≥ 9 x + 2y ≤ 22 x ≥ 0, y ≥ 0.

no optimal solution as feasible region is empty

Step-by-step explanation:

The complete question is:

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 = 6x − 6y subject to 5x ≤ y y ≤ 2x 7 x + y ≥ 9 x + 2y ≤ 22 x ≥ 0, y ≥ 0.

See the attachment to understand the following explanation.

The shaded regions shown in attachment obeys all constraints except for 5x ≤ y and y ≤ 2x. The shaded region 1 obeys all constraints except y ≤ 2x and shaded region 2 obeys all constraints except 5x ≤ y. So there is no feasbile region. Hence no optimal solution exists

the barter