|4x + 3y ≥ 30
|x + 3y ≥ 21
|x ≥ 0, y ≥ 0
--
Minimun for
C = 5x + 8y

1. List all vertices of the feasible region as ordered pairs.
2. List the values of the objective function for each vertex.
3. List the maximum or minimum amount, including the x, and y-value, of the objective function.

I really really need help! I don't understand what to do.

Question

|4x + 3y ≥ 30
|x + 3y ≥ 21
|x ≥ 0, y ≥ 0
--
Minimun for
C = 5x + 8y

1. List all vertices of the feasible region as ordered pairs.
2. List the values of the objective function for each vertex.
3. List the maximum or minimum amount, including the x, and y-value, of the objective function.

I really really need help! I don't understand what to do.

anonymous · Answer

Are you having issues graphing these equations?

anonymous · Answer

Yes. Just all of it. I did the first step which was to rewrite the constraints in slope-intercept form. I just don't really know what to do from there.

anonymous · Answer

ok so I would graph out your constraints to see how many vertices you have.

anonymous · Answer

How do you do that?

anonymous · Answer

|dw:1351370399352:dw|