Ask your own question, for FREE!
Mathematics 15 Online
OpenStudy (anonymous):

Linear Programming. PLEASE HELP!!!!!?? 1. Rewrite the constraints in slope-intercept form 2. List all vertices of the feasible region as ordered pairs. 3. List the values of the objective function for each vertex. 4. List the maximum or minimum amount, including the x, and y-value, of the objective function. (Picture attached.)

OpenStudy (anonymous):

OpenStudy (anonymous):

Solve for y in all of them. Can you do that?

OpenStudy (anonymous):

I don't understand how to do this at all..

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!