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


Graph all of the constraint inequalities and then find the vertices of the feasibility polygon that is the intersection of the solution sets of all of the constraint inequalities.  Then test the values of the coordinates of the vertices in the objective function to find the maximum.

																
John
*[tex \LARGE e^{i\pi}\ +\ 1\ =\ 0]
My calculator said it, I believe it, that settles it
*[illustration darwinfish.jpg]

From <https://www.algebra.com/cgi-bin/upload-illustration.mpl> 
I > Ø
*[tex \Large \ \
*[tex \LARGE \ \ \ \ \ \ \ \ \ \  
								
{{n}\choose{r}}
</font>