document.write( "Question 117459: Graph the system of constraints. Then find the values of x and y that maximize A=20x+30y and list the maximum value.\r
\n" ); document.write( "\n" ); document.write( "x greater then or equal to 0
\n" ); document.write( "y greater then or equal to 0
\n" ); document.write( "-2x+4y less then or equal to 4
\n" ); document.write( "x less then or equal to 4
\n" ); document.write( "

Algebra.Com's Answer #85466 by Fombitz(32388)\"\" \"About 
You can put this solution on YOUR website!
The constraints marks the feasible region that lies on and within this green lined polygon.\r
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "From linear programming, a solution exists at one of the bounding vertices (0,0), (0,1), (4,0), or (4,3).
\n" ); document.write( "A=20x+30y
\n" ); document.write( "A(0,0) = 20(0)+ 30(0)= 0
\n" ); document.write( "A(0,1) = 20(0)+ 30(1) = 30
\n" ); document.write( "A(4,0) = 20(4)+ 30(0) = 80
\n" ); document.write( "A(4,3) = 20(4)+ 30(3) = 170
\n" ); document.write( "The (x,y) pair that maximizes A in the feasible region is (4,3).
\n" ); document.write( "
\n" );