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


Graph your three constraint inequalities on the same coordinate axes. You will have a trapezoid as a feasible area.  An optimum, if it exists, must be at a vertex of your area of feasibility.  So, look at your vertices (0,2), (1,2), and since nothing with a negative x is going to work, use (0,0) and (3,0) as your other two vertices.  Insert the coordinate values of your vertices one at a time into your profit function.  The one with the biggest answer is your optimum.


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>