The Fagersta Steelworks currently is working two mines to obtain its iron ore. This iron ore is shipped to either of two storage facilities. When needed, it then is shipped on to the company's steel plant. The diagram below depicts this distribution network, where M1 and M2 are the two mines, S1 and S2 are the two storage facilities, and P is the steel plant. The diagram also shows the monthly amounts produced at the mines and needed at the plant, as well as the shipping cost and the maximum amount that can be shipped per month through each shipping lane.

Management now wants to determine the most economical plan for shipping the iron ore from the mines through the distribution network to the steel plant.
a. Identify all the requirements that will need to be expressed in fixed-requirement constraints.
b. Formulate and solve a linear programming model for this problem on a spreadsheet.
c. Express this model in algebraic form?

Transcribed Image Text:

40 tons $2,000/ton s1 produced (M1 30 tons max. $400/ton 70 tons max. 100 tons needed $800/ton 70 tons max. $1,100/ton 60 tons S2 M2 produced 50 tons max. $1,700/ton 30 tons max. uO/009'I$ 50 tons max.