Consider the following linear program: objective function:

Min Z = $12x + $36y

constraints:

5x + 10y ≤ 300

15x + 10y ≤ 600

x, y ≥ 0

What is the optimal solution?

Group of answer choices

Min Z = 240

Min Z = 120

Min Z = 360

Min Z = 320

greater than one

step-by-step explanation:

i suppose it should be (y=2x-5)

step-by-step explanation:

just took the test and my answers down below!

step-by-step explanation:

check the pic :

let's call the solutions x₁ = (5 - 2√7)/3 and x₂ = (5 + 2√7)/3

then the equation is (x-x₁)(x-x₂) = 0

if you fill that in you get a lot of numbers which you can recognize as ax²+bx+c=0.

step-by-step explanation:

you can see that a=1 (there is just an x²)

b = (-5 -2√7 + 2√7 - 5)/3 = -10/3

c = -2√7)/3 ) * (-5+2√7)/3) = -1/3

so your answer is 3x^2 – 10x – 1 = 0