document.write( "Question 1023175: maximize Z=8x+7y subject to 3x+y≤66 ,x+y≤45 ,x≤20 ,y≤40,x,y≥0 \n" ); document.write( "
Algebra.Com's Answer #638786 by robertb(5830)![]() ![]() You can put this solution on YOUR website! Solution by the graphical method. (Typesetting here of simplex method would be brutal. The graphical method is a little less difficult, but the region of feasibility will not be reproduced.)\r \n" ); document.write( "\n" ); document.write( "The region of feasibility would be a hexagon (six-sided) figure with the following corner points (in ccw direction): \n" ); document.write( "(0,0), (20,0), (20,6), (21/2,69/2), (5,40), and (0,40). \n" ); document.write( "For (0,0), Z = 0 \n" ); document.write( "For (20,0), Z = 8*20 = 160 \n" ); document.write( "For (20,6), Z = 202 \n" ); document.write( "For (21/2,69/2), Z = 325.5 \n" ); document.write( "For (5,40), Z = 320, and \n" ); document.write( "For (0,40), Z = 280 \n" ); document.write( "By the fundamental theory of linear programming the maximum exists at the point (21/2,69/2) with a Z value of 325.5. \n" ); document.write( " |