Consider a linear programming problem with the following constraints and objective function, C. y≤
1
2
x+5
y≥x+2
y≥
–
2x–10
C=9x+3y
The constraints are graphed below.
What is the minimum value of the objective function for the feasible region?

a

step-by-step explanation:

step-by-step explanation:

-8/2y-8=5/y+4-7y+8/y^2-16

we move all terms to the left:

-8/2y-8-(5/y+4-7y+8/y^2-16)=0

we can not solve this equation

its kinda hard to answer this when we dont have all the information that we need.