- Pete S Plastics Manufactures Plastic At Plants In Miami St Louis And Cleveland Pete Needs To Ship Plastic To Customer 1 (205.91 KiB) Viewed 37 times
2.
- Pete S Plastics Manufactures Plastic At Plants In Miami St Louis And Cleveland Pete Needs To Ship Plastic To Customer 2 (313.09 KiB) Viewed 37 times
3.
- Pete S Plastics Manufactures Plastic At Plants In Miami St Louis And Cleveland Pete Needs To Ship Plastic To Customer 3 (216.46 KiB) Viewed 37 times
Pete's Plastics manufactures plastic at plants in Miami, St. Louis and Cleveland. Pete needs to ship plastic to customers in Pittsburgh, Atlanta and Chicago. He wants to minimize the cost of shipping the plastic from his plants to his customers. The data for the problem is summarized in the following excel sheet. 1 2 3 4 5 6 7 A B Plant Miami St. Louis Cleveland Amount Received O Demand. (tons) с Pittsburgh 40 D } Total Transportation Cost E Markets Atlanta Chicago 60 20 Unit Shipping Costs (S/ton) Pittsburgh Atlanta A B 8 9 10 11 12 13 14 15 16 17 18 The following list and dictionary were defined to solve the problem using pulp optimization library: Plant Miami $ 1,200.00 $ 700.00 St. Louis S 700.00 $ 550.00 $ 300.00 Cleveland $ 125.00 $675.00 S 350.00 Chicago с $1,300.00 F Amount Supply Shipped (tons) Plants = ['Miami', 'StLouis', 'Cleveland' ] Plants Supply = { 'Miami': 30, 'StLouis':40, 'Cleveland':50 } G Customers= ['Pittsburgh', 'Atlanta', 'Chicago'] Customers_Demand= { 'Pittsburgh': 40, 'Atlanta':60, 'Chicago":20} 30 40 50 Distances = { 'Miami':{'Pittsburgh': 12000, 'Atlanta':700, 'Chicago':1300), 'StLouis':{'Pittsburgh': 700, 'Atlanta':550, 'Chicago' :300), 'Cleveland':{'Pittsburgh': 125, 'Atlanta':675, 'Chicago':350} Which of the following represent the correct code for the capacity constraints that guarantee that the amount of products shipped out of each plant is not more than the corresponding plant's capacity. O for i in Plants: Pete Plastics_prob += 1pSum (Amount[j] for j in Customers) <= Capacity for i in Plants: Pete Plastics_prob += 1pSum (Amount[j] for j in Customers) >= Capacity O for j in Plants: Pete Plastics_prob += 1pSum (Amount[j] for i in Customers) >= Capacity [j] for j in Plants: Pete Plastics_prob += 1psum (Amount[j] for i in Customers) <= Capacity[j]
Pete's Plastics manufactures plastic at plants in Miami, St. Louis and Cleveland. Pete needs to ship plastic to customers in Pittsburgh, Atlanta and Chicago. He wants to meet the customer's demand such that the cost of shipping the plastic from his plants to his customers is minimized. The data for the problem is summarized in the following excel sheet. 1 2 3 4 st 56 7 8 9 10 11 12 ~ 3 13 14 15 16 17 18 5678 A B Plant Miami St. Louis Cleveland Amount Received Demand (tons) Plant Miami St. Louis Markets Pittsburgh Atlanta с 40 Pittsburgh Atlanta A B Cleveland S 125.00 $C$7: $E$7 = $C$8: $E$8 Total Transportation Cost $C$7: $E$7 <= $C$8: $E$8 D $F$4:$F$6 <= $G$4:$G$6 $ 1,200.00 $ 700.00 $ S 700.00 $ 550.00 $ $675.00 S O $F$4:$F$6 = $G$4:$G$6 60 Unit Shipping Costs (S/ton) E Chicago 20 Chicago с 1,300.00 300.00 350.00 Which of the following constraint can be used to represent the capacity constraints for the Plants? Note that it is not necessary to ship all the available amount of plastic at the plants. F Amount Supply Shipped (tons) 30 40 50