In Example 2B we saw that there was no optimal solution for the problem of maximizing the objective function z over the feasible region S. We want to add an additional constraint to modify the feasible region so that an optimal solution for the maximization problem does exist. Which of the following constraints will accomplish this objective?

(A) x ≤ 20 

(B) y ≥ 4 

(C) x ≤ y 

(D) y ≤ x

Example 2B

Minimize and maximize subject to

Minimize and maximize subject to

Transcribed Image Text:

z=3x + y 2x + y ≤ 20 10x + y ≥ 36 2х + 5y ≥ 36 x, y ≥ 0