Question 451696
<font face="Times New Roman" size="+2">


For the first problem use the theorem that says any optimum must be at the vertex of the feasible area polygon.


Graph your constraints and you will find that your feasible area is bounded by the x and y axes, the line segment joining the y-intercept of the 2x + 2y = 8 constraint boundary and the point of intersection of that constraint boundary and the 3x + 5y = 16 constraint boundary, and finally the line segment from the boundary intersection to the x-intercept of 3x + 5y = 16.


Hence, your three possible optimums are at (0, 4), (2, 2), and (5.33, 0)]


You can do your own coordinate geometry calculations to check my work on that part.


Now all you have to do is substitute the coordinate values from your three possible optimums into the objective function to see which one gives you he minimum result.


One problem per post there, Sparky.  Read the instructions.


John
*[tex \LARGE e^{i\pi} + 1 = 0]
My calculator said it, I believe it, that settles it
<div style="text-align:center"><a href="http://outcampaign.org/" target="_blank"><img src="http://cdn.cloudfiles.mosso.com/c116811/scarlet_A.png" border="0" alt="The Out Campaign: Scarlet Letter of Atheism" width="143" height="122" /></a></div>
</font>