document.write( "Question 1206902: Solve the following linear programming model geometrically, labeling all the corner points and shading the feasible or solution region
\n" ); document.write( "Maximize z = 200x+100y
\n" ); document.write( "Subject to: 3x+4y ≤ 24
\n" ); document.write( " X+y ≤ 16
\n" ); document.write( " X+3y≤30
\n" ); document.write( " X,y ≥0
\n" ); document.write( " \n" ); document.write( "
Algebra.Com's Answer #844634 by Edwin McCravy(20055)\"\" \"About 
You can put this solution on YOUR website!
Maximize z = 200x+100y
\n" ); document.write( "Subject to: 3x+4y ≤ 24
\n" ); document.write( "X+y ≤ 16
\n" ); document.write( "X+3y≤30
\n" ); document.write( "X,y ≥0
\r\n" );
document.write( "Are you sure some of those first three ≤'s shouldn't have been ≥ ?.\r\n" );
document.write( "The graph seems funny because the first two restraints are irrelevant,\r\n" );
document.write( "So the feasible region is on or below all three lines, which means it's\r\n" );
document.write( "just on or below the green shaded region below the bottom line.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "That means there are only three corner points\r\n" );
document.write( "\r\n" );
document.write( "(0,0), (0,6), and (8,0)\r\n" );
document.write( "\r\n" );
document.write( "Substituting (x,y) = (0,0) in z = 200x+100y,\r\n" );
document.write( "z = 200(0)+100(0) = 0 + 0 = 0\r\n" );
document.write( "\r\n" );
document.write( "Substituting (x,y) = (0,6) in z = 200x+100y,\r\n" );
document.write( "z = 200(0)+100(6) = 0 + 600 = 600\r\n" );
document.write( "\r\n" );
document.write( "Substituting (x,y) = (8,0) in z = 200x+100y,\r\n" );
document.write( "z = 200(8)+100(0) = 1600 + 0 = 1600\r\n" );
document.write( "\r\n" );
document.write( "So the maximum value for z is 1600 when x = 8 and y = 0.\r\n" );
document.write( "\r\n" );
document.write( "Edwin
\n" ); document.write( "
\n" );