document.write( "Question 500746: Help with Linear Programming. I don't know how to solve this. If profit is represented by P=3x+4y, find the maximum profit under these constraints: y + x <= 3 ; y >= 0 ; y <= 2 Hellpppp. \n" ); document.write( "

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

You can put this solution on YOUR website!
\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "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.\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" );