Transportation problem in Excel.

I tried to solve some of the first questions but I don't know whether it is correct or not. I really hope that you can help me to get all the correct answers on the questions below.

Thanks in advance!

In the below you can see what I have tried:

- Here is what I wrote in Excel before solver:

- Here is what I wrote in the solver:

- Here is my results:

Exercise 4 (25 percent) DJ Sciences and Technologies Ltd. is a Chinese technology company headquartered in Shenzhen, China with factories throughout the world, and is a world-leading manufacturer of commercial unmanned aerial vehicles (commonly known as "drones") for aerial photography and videography. The company plans to launch a new model of drone to the European market in early 2021. DJI has 5 factories producing this new model, which have production capacities listed below Factory 1 Factory 1 Factory 2 Factory 3 Factory 4 Factory 5 900 1200 890 860 950 The Chinese company has received orders from 6 clients. Client 1 and 2 require exact quantities 600 and 720 units respectively to be delivered to them, no more no less. The other clients require a minimum quantity to be delivered. The exact order quantities from client 1 and 2 as well as the minimum order quantities from the other clients are listed below Client 1 Client 2 Client 3 Client 4 Client 5 Client 6 600 720 890 820 620 730 Suppose that there are unit transportation costs induced by shipping drones from different factories to different clients. The unit costs of transportation are listed in the table below Client1 Client 2 Client 3 Client 4 Client 5 Client 6 Factory 1 45 Factory 2 64 56 54 35 5 4 34 Factory 3 45 45 30 47 50 56 Factory 4 54 49 45 29 6 6 53 Factory 5 35 54 68 42 45 47 The unit costs above are given in thousand DKK 1. Formulate a transportation problem for DJ, where you minimize the total transportation cost. How many decision variables are there in the model? How many constraints are there in the model? 2. Formulate and solve the problem by using Excel and the Problem Solver. Use the Problem Solver to conduct a sensitivity analysis. 3. How many units of product should be transported from factory 4 to client 5? 4. How much cost does DJI need to pay at the optimal decision you obtained in Question 2? You are expected to involve the sensitivity report from Question 2 when answering the following Questions 34 23 40 5-6. 5. If DJI can increase the capacities of each plant by paying 5000 DKK for each extra unit of capacity at all factories, should DJI increase capacities of the plants? If yes, where should DJI increase the capacity, and why? 6. Assume that the minimum demand of client 4 increases from 820 to 880. a) Is it possible to use dual prices (shadow-prices) to calculate the total cost in a new optimal solution? Justify your answer. Calculate an optimal solution to the modified transportation problem. b) Calculate the optimal minimal cost to the modified transportation problem. c) Calculate the change in the minimal cost (compared your answer in Question 4). 1 1 Client 1 client 2 Client 3 Factory 1 Factory 2 Factory 3 Factory 4 Factory 5 Demand total 0 0 0 0 0 0 0 0 720 0 Client 4 client client 6 Supply total 900 0 12001 0 0 0 8901 0 0 0 860 0 950 820 620 730 0 0 0 600 0 890 0 total cost = Client i 56 Factory 1 Factory 2 Factory 3 Factory 4 Factory 5 Demand Client 2 Client 3 Client 4 Client client 6 Supply 900 56 54 35 1200 45 30 47 50 890 4529 860 54 68 42 45 950 720 890 820 620 730 35 client 1 Client 2 Client 3 Client 4 Client 5 Client 6 Supply 900 1200 890 860 950 total =SUM(C8:H8) =SUM(C9:H9) =SUM(C10:H10) =SUM(C11:H11) =SUM(C12:H12) Factory 1 Factory 2 Factory 3 Factory 4 Factory 5 Demand total O O 600 =SUM(C8:C12) 720 =SUM(D8:012) 890 -SUM(E8:E12) 820 =SUM(F8:F12) 620 =SUM(G8:G12) 730 =SUM(H8:H12) total cost = =SUMPRODUKT(C8:H1 Client 1 Client 2 Client 3 Client 4 Client 5 Client 6 56 45 Supply 900 1200 890 860 950 30 47 56 Factory 1 Factory 2 Factory 3 Factory 4 Factory 5 Demand 45 50 66 29 42 720 890 820 620 730 IuIumICLI LILIUDICINCI Angiv mlstning: $C$16 Til: O Maksimal O Min O Vrdi af: Via ndring af variabelceller: $C$8:$H$12 Underlagt begrnsninger: $C$14:$H$14 >= $C$13:$H$13 $J$8:$J$12 = $C$13:$H$13 $J$8:$J$12