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

question 21

Essay

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}$$

---

Definitions:

Voir Dire

Voir dire is a legal process in which attorneys question prospective jurors to determine any biases or inability to serve impartially in a jury.

Objection

A legal term referring to a statement by an attorney during a trial, disagreeing with a method or evidence presented by the opposition.

In Limine

A legal term referring to a procedural motion made to the court, typically before a trial begins, to request that certain evidence be deemed inadmissible or not shown to the jury.

Alternate Jurors

Additional jurors selected in trials who replace any original jurors unable to complete their duty.