The company has 5 different storage. All have a limited serving to the shops per day. In table A we can see capacities. In table B we can see the demand for the shops per day. In table C we can see the cost of delivery per unit. Lastly, in table D, we can see the efficiency ratio of delivery. For delivery we used trucks. Those trucks only loads of 1 or more can be sent to shops.

First, do the modeling part, and second, solve this problem with the branch and bound method.

hint: this problem asks to minimize the cost.

Transcribed Image Text:

storage storage 2 storage 3 storage 3 storage 4 storage table A s capacity 18 15 17 50 20 10 demand shop! shop shop shopd shops table 70 9 2 12 21 deliver co(5) storage storage storage storaged Morages Table C T shop! shop 21 7 1 14 6 10 3 2 " 22 9 11 LE 2 shopd 4 11 S 13 3 shops 12 3 . ratio of delivery customer 0.7 customer2 04 stomer 3 08 customer 02 customers 0.35 shop! 0.45 0.32 0.44 0.12 0.19 shop2 0:22 0.9 0.95 0.75 04 shop 06 0.66 0.48 0.33 0.76 shop4 table D 021 0.55 0.46 0.64 0.88 shoes storage storage 2 storage 3 storage 3 storage 4 storage table A s capacity 18 15 17 50 20 10 demand shop! shop shop shopd shops table 70 9 2 12 21 deliver co(5) storage storage storage storaged Morages Table C T shop! shop 21 7 1 14 6 10 3 2 " 22 9 11 LE 2 shopd 4 11 S 13 3 shops 12 3 . ratio of delivery customer 0.7 customer2 04 stomer 3 08 customer 02 customers 0.35 shop! 0.45 0.32 0.44 0.12 0.19 shop2 0:22 0.9 0.95 0.75 04 shop 06 0.66 0.48 0.33 0.76 shop4 table D 021 0.55 0.46 0.64 0.88 shoes

Answer rating: 100% (QA)

Modeling Part Question 1 This problem can be modeled as a linear program LP that seeks to minimize the total cost of delivery from the 5 different storages to the shops The objective function is to mi... View the full answer