Question 227686
To solve problems like this:<ol><li>Graphs the constraints. This should form some form of polygon.</li><li>Find the coordinates of the vertices of the polygon.</li><Try each of the vertices in the expression you are trying to minimize (or maximize for that matter). One of the vertices will be the minimum (or maximum)</li></ol>
Unfortunately Algebra.com's graphing software does not handle graphs like this very well. So I will have to describe the graph of the contraints. Each contraint will form a side of the polygon.<ul><li>y <= 5: A horizontal line through 5 on the y-axis</li><li>x <= 6: a vertical line through 6 on the x-axis</li><li>x+y >= 2. In slope-intercept form this is y >= -x + 2. This is a line with a slope of -1 through 2 on the y-axis</li><li>x >=0: the y=axis</li><li>y >=0: the x-axis</li></ul>
Here's a partial graph (without the x <=6 line):
{{{graph(300, 300, -1, 7, -1, 7, 5, -x+2)}}}
Remembering the missing vertical line through 6 on the x-axis, we end up with a pentagon (5-sided polygon). Any points that are within the pentagon or on the sides of the pentagon are possible solutions. The minimum (or maximum) value for Z will come from one of the vertices. So we need to find the vertices. By inspection (or with a little calculation) we can find the following vertices: (0, 2), (0, 5), (6, 5), (6, 0) and (2, 0).<br>
Now all we need to do is use these vertices to find the minimum value for Z. Take each vertex, one at a time, and put its coordinates into the formula for Z. This will give you 5 different values for Z. The lowest one is the minimum.<br>I'll do one Z and leave the rest for you. The Z for the vertex (0, 2):
Z = 2(0) + 3(2) = 0 + 6 = 6