document.write( "Question 536528: Need help on this\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Given the profit equation and the constraints of a linear programming problem below, find the best profit using the Method of Corners. Maximize: P = 2x + 3y Subject to: x + y < 5, x > 0 and y > 0 answer \n" ); document.write( "

Algebra.Com's Answer #352409 by solver91311(24713) $\"\"$ $\"About$

You can put this solution on YOUR website!
\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "You cannot maximize your objective function with the given constraints. Your constraints are strictly \"less than\" or \"greater than\", and specifically your

constraint has a boundary line that is NOT in the solution set of the constraint inequality. If it were an inequality inclusive of equals then the corner points (0,5) and (5,0) of your feasiblity polygon would be included and you would easily note that (0,5) would give you the maximum value of 15. But the problem with strict inequalities is that you could pick a positive number as small as you like for x and a number as close as you like to 5 without exceeding it and come up with an objective function answer very close but still less than 15, but then I could pick another pair of numbers and get a little closer, after which you could pick a pair of values to get even closer...and neither of us would ever \"win\" the game. \r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "John
\n" ); document.write( "

\n" ); document.write( "My calculator said it, I believe it, that settles it
\n" ); document.write( "

$\"The$

\n" ); document.write( " \n" ); document.write( "

\n" );