Heidi B.

asked • 12/29/16

I don't understand what the Question is asking me

The following polygon of constraints represents the solution for an optimization situation that involves minimizing the costs of sugar and salt. the values in the table below were calculated in order to determine the minimum cost. In this situation, how many solutions minimize the cost?
The table says
vertex A costs $50
vertex B costs $50
vertex C costs $75
vertex D costs $85
possible answers are greater than 3, greater than 2, greater than 1, and less than 2.
The polygon of constraints doesn't have any numbers on it so I don't know what I'm supposed to do with it and the question doesn't seem to make any sense either. I just can't figure out what the answer is.

1 Expert Answer

By:

Heidi B.

So you're saying that since vertex A and B have the same costs, that all the points in between must be the same as well? so the answer to my question must be greater than 3 right.
Report

12/30/16

Kenneth S.

It looks to me as if the basic idea in Linear Programming has not been made clear to the student.
The optima (min & max) occur only at corner points of the polygonal Feasible Region.
Report

12/30/16

Stephen M.

tutor
Yes, Heidi.  You have the right idea. As Kenneth said, typically we only look at the vertex.  This question probes your understanding of why that works with a special case where two vertices, and therefore an entire edge, give the optimal value.
Report

12/30/16

Heidi B.

Ohhh I get it now yes thank you so much!!
Report

12/30/16

Still looking for help? Get the right answer, fast.

Ask a question for free

Get a free answer to a quick problem.
Most questions answered within 4 hours.

OR

Find an Online Tutor Now

Choose an expert and meet online. No packages or subscriptions, pay only for the time you need.