The following linear programming problem has _________________.

Min Z = 3x₁ +9x₂

Subject to:

2x₁ + 4x₂ 16

5x₁ + 15x₂ 30

6x₁ + 14x₂ 42

x1 20

x₁, x₂ 0

Please choose the option that would best fit the empty space above:

Group of answer choices

only one optimal solution

multiple optimal solutions

no solution, since it is infeasible

no best solution, since it is unbounded

None of the above

The following linear programming problem has Min Z = 3X1 +9x2 = Subject to: 2x1 + 4x2 = 16 5x1 + 15x2 = 30 6X1 + 14x2 = 42 x1 2 20 X1, X2 = 0 Please choose the option that would best fit the empty space above: only one optimal solution multiple optimal solutions no solution, since it is infeasible no best solution, since it is unbounded O None of the above