Current location - Training Enrollment Network - Mathematics courses - Mathematical modeling linear programming problem
Mathematical modeling linear programming problem
Suppose that X bread and Y sausage are produced every week, and the profit is S.

X≤200/0. 1=2000,y≤800/0.25=3200。

In order to maximize profits, workers should work the longest time, 40 hours is 2400 minutes, of which 2x+3y=2400*5→x=6000-3y/2, y=4000-2x/3.

S = x+2y = 6000-3y/2+2y = 6000+y/2 ≤ 6000+3200/2 = 7600. When y = 3200, the maximum value of S is 7600 →x= 1200.

Therefore, when 1200 loaves and 3200 sausages are produced every week, the maximum possible profit can be obtained.

In fact, in actual operation, we should also consider the cost of raw materials that are not used up.