Respuesta :
The correct answer for the question that is being presented above is this one: "C) 3 tons from source A, 0 tons from source B." The tons of ore from each source should be processed each day to maximize the amount of steel produced is that C) 3 tons from source A, 0 tons from source B
The answer for this problem is B) 2 tons from source A, 4 tons from source B.
To solve an optimization problem, you can use linear programming or simply algebra. Based on the statements given, you can create three equations for the constraints, using ore A as x and ore B as y.
x + y >= 3 (at least three tons of ore must be processed each day)
20x + 10y <= 80 (costs must be kept to no more than $80 per day)
y/x <= 2 (ore from source B cannot exceed twice the amount of ore from source A)
The function to be optimized in the problem is for the amount of steel produced: 300x + 400y
This gives 2 solutions at points (2, 4) and (1, 2). Now, test which solution MAXIMIZES the production of ore:
@ (2,4): 300*2 + 400*4 = 2200 lbs ore
@(1,2): 300 + 400*2 = 1100 lbs ore
So B is the answer.
To solve an optimization problem, you can use linear programming or simply algebra. Based on the statements given, you can create three equations for the constraints, using ore A as x and ore B as y.
x + y >= 3 (at least three tons of ore must be processed each day)
20x + 10y <= 80 (costs must be kept to no more than $80 per day)
y/x <= 2 (ore from source B cannot exceed twice the amount of ore from source A)
The function to be optimized in the problem is for the amount of steel produced: 300x + 400y
This gives 2 solutions at points (2, 4) and (1, 2). Now, test which solution MAXIMIZES the production of ore:
@ (2,4): 300*2 + 400*4 = 2200 lbs ore
@(1,2): 300 + 400*2 = 1100 lbs ore
So B is the answer.