<PRE><B>Question 616985</B>
&lt;font face=&quot;Times New Roman&quot; size=&quot;+2&quot;&gt;


Substitute the coordinate values for each of your feasible region vertices and calculate the value of the objective function for each one.  The largest one is the maximum of the objective.  If two adjacent points have the same objective function value, then any point on the segment that joins those two points is an optimum.


John
*[tex \LARGE e^{i\pi}\ +\ 1\ =\ 0]
My calculator said it, I believe it, that settles it
&lt;div style=&quot;text-align:center&quot;&gt;&lt;a href=&quot;http://outcampaign.org/&quot; target=&quot;_blank&quot;&gt;&lt;img src=&quot;http://cdn.cloudfiles.mosso.com/c116811/scarlet_A.png&quot; border=&quot;0&quot; alt=&quot;The Out Campaign: Scarlet Letter of Atheism&quot; width=&quot;143&quot; height=&quot;122&quot; /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;/font&gt;</PRE>