Method of Corners Linear programming problem. Please Help!?

Could someone please explain how to figure out this problem.


This is a study question to help me on a future exam not homework questions. Please help explain.


Given the linear programming problem





Minimize C = x + 2y subject to


x%26lt; 3


y%26lt; 5


x + y%26gt; 5


x%26gt; 0, y%26gt; 0


Use the method of corners to determine the where the minimum occurs, and give the minimum value.

Method of Corners Linear programming problem. Please Help!?
Susan, all inequalities must be non-strict / ≤ or ≥ /, otherwise Your problem has no solution, we can't guarantee that minimum is reached. Graph the domain now, You'll have a vertical line 3 units right from the origin /the corresponding semi-plane to the left from it, You have x ≤ 3/; a horizontal one 5 units above /the semi-plane down/; connect the points (0,5) and (5,0); the domain is a right triangle in the 1st quadrant with vertexes (3,2), (3,5) and (0,5). Calculate the values of C in them:


C(3, 2) = 7, C(3, 5) = 13, C(0, 5) = 10, so the minimum value is 7 and is reached in the point (3,2)