document.write( "Question 1123219: A steel company has two mills. Mill 1 costs $70,000 per day to operate, and it can produce 400 tons of high-grade steel, 500 tons of medium-grade steel, and 450 tons of low-grade steel each day. Mill 2 costs $60,000 per day to operate, and it can produce 350 tons of high-grade steel, 600 tons of medium-grade steel, and 400 tons of low-grade steel each day. The company has orders totaling 100,000 tons of high-grade steel, 150,000 tons of medium-grade steel, and 124,500 tons of low-grade steel. How many days should the company run each mill to minimize its costs and still fill the orders? \n" ); document.write( "
Algebra.Com's Answer #739841 by Theo(13342)![]() ![]() You can put this solution on YOUR website! x = number of days to operate mill 1. \n" ); document.write( "y = number of days to operate mill 2.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "your objective function is 70,000 * x + 60,000 * y.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "you will evaluate this objective function at each of the corner points of the feasible region on the graph to find the corner point that has the least cost.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "your constraint functions are:\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "400x + 350y >= 100,000 (hi grade steel requirement) \n" ); document.write( "500x + 600y >= 150,000 (medium grade steel requirement) \n" ); document.write( "450x + 400y >= 124,500 (lo grade steel requirement) \n" ); document.write( "x,y >= 0 (number of days can't be negative)\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "using the desmos.com calculator, you will graph the opposite of these inequalities.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "the area on the graph that is not shaded is your region of feasibility.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "the corner points of this region are where the minimum cost will be found.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "the graph looks like this:\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " ![]() \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "the corner points are (0,311.25), (210,75), (300,0)\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "the cost at (0,311.25) is 0 * 70,000 + 311.25 * 60,000 = 18,675,000. \n" ); document.write( "the cost at (310,75) is 210 * 70,000 + 75 * 60,000 = 19,200,000. \n" ); document.write( "the cost at (300,0) is 300 * 70,000 + 0 * 60,000 = 21,000,000.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "the minimum cost is when you run mill2 for 311.25 daya.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "all the constraint functions need to be met when x = 0 and y = 311.25\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "400x + 350y = 108937.5 which is > 100,000. \n" ); document.write( "500x + 600y = 186,750 which is > 150,000. \n" ); document.write( "450x + 400y = 124,500 which is e3qual to 124,500.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "both x and y are > 0.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "all the constraint are met and the cost is minimum when x = 0 and y = 311.25.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "that means mill 2 gets a lot of work and mill 1 doesn't get any.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " |