Does the following linear programming problem exhibit infeasibility,unboundedness,or alternate optimal solutions? Explain.
$$\begin{array} { l l }
\text { Min } & 1 x + 1 y \
\text { s.t. } & 5 x + 3 y \leq 30 \
& 3 x + 4 y \geq 36 \
& y \leq 7 \
& x , y \geq 0
\end{array}$$

Question

Does the following linear programming problem exhibit infeasibility,unboundedness,or alternate optimal solutions? Explain.
 $$\begin{array} { l l } 
\text { Min } & 1 x + 1 y \
\text { s.t. } & 5 x + 3 y \leq 30 \
& 3 x + 4 y \geq 36 \
& y \leq 7 \
& x , y \geq 0
\end{array}$$

Quizplus · Accepted Answer

The Answer of Does the following linear programming problem exhibit infeasibility,unboundedness,or alternate optimal solutions? Explain.
 $$\begin{array} { l l } 
\text { Min } & 1 x + 1 y \
\text { s.t. } & 5 x + 3 y \leq 30 \
& 3 x + 4 y \geq 36 \
& y \leq 7 \
& x , y \geq 0
\end{array}$$

Does the Following Linear Programming Problem Exhibit Infeasibility,unboundedness,or Alternate Optimal