3.18) a,b,c

Lar lison * iter 3. 18. The Fagersta Steelworks currently is working two Col' 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 dis- tribution network, where MI and M2 are the two mines, S1 and $2 are the two storage facilities, and P is the steel plant. The 110 Chapter Three Linear Programming: Formulation and Applications chagram also shows the monthly amounts produced at the mines and needed at the plant, as well as the shipping cost and the veral maximum amount that can be shipped per month through each shipping lane. 40 tons $2,000/ton Alloy produced M1 30 tons max. Prop- 5 $400/ton $1,700/ 70 tons max. 100 tons age of tim ton needed 40 30 tons max. 9/909'IS Perce .du 10 10 Cos max $800/ton 50 70 tons max. The VS 60 tons $1,100/ton $2 that - piouuce the new allov at a re- u wust. produced M2 50 tons max. ". Identify all +1. awww to be Management now wants to determine the most economical -quirement constraints. plan for shipping the iron ore from the mines through the distri- E* " programming model bution network to the steel plant. a. Identify all the requirements that will need to be C. expressed in fixed-requirement constraints. puration has three branch plants with E* ex b. Formulate and solve a linear programming model new for this problem on a spreadsheet. this a need in this c. Express this model in algebraic form. way. n