Marking scheme As stated in the module guide, this assignment will contribute 35% of the marks for the module as a whole. The marking scheme for this assignment is as follows: Build an appropriate mathematical model to represent the problem (30%) Identify mathematical methods to approach the model (20%) Solve the problem with identified methods (20%) Present results with computer simulation and technical documentations (30%) . Some things for you to consider Have you analyzed the model in the most appropriate ways? Have you drawn sensible conclusions from your analysis? Have you included relevant and useful visual representations of the data and of your findings? Have you included any irrelevant material? Is your spelling, grammar and document formatting all OK? Problem Statement There is a transport network laid over 6 major cities (C... C) in a country (Figure 1). A logistics company transports two shipments (5,52) from G to Co. The logistic cost of them from to is denoted by LC(i, j) is subject to the individual transportation cost of the products Figure 1 LC2.4) LC(1,2) LC(2,3) LC(2,5) LC(4,5) BE BE LC(1.6) C LC(6.6) LC(3.6) . TH LC(3,5) Cs Shipment2 (S2) 7 Logistic cost between adjacent cities 1,2 1,6 2,3 2,4 Shipment 1(S) 6 3 2 5 3 4 4 6 5 2,5 3,5 3,6 4,5 Lowu w 00 00 WN 5,6 Table 1 Logistics Cost between Adjacent Cities The shipment carries two products (AP), due to various transport conditions and customs rules each connecting road has constraints on carrying a specific number of units of each product per shipment. Also, maximum capacity of products are also capped (Table 2). Problem: The shipment company wants to calculate a probability density function for the subjected transportation problem by mapping the optimistic (best) and pessimistic (worst) cost of transport through all possible ways between cities and Co Road 1,2 Shipment 1 Shipment 2 1 6 5 3 Max Load 20 6 10 w 1,6 3 ON 5 6 2,3 10 5 1 12 40 12 2,4 No N 00 15 10 2,5 Product Product 1 Product 2 Product 1 Product 2 Product 1 Product 2 Product 1 Product 2 Product 1 Product 2 Product 1 Product 2 Product 1 Product 2 Product 1 Product 2 Product 1 Product 2 7 5 10 5 20 15 3,5 5 16 20 14 2 8 3,6 5 18 25 6 22 6 4,5 10 16 1 3 10 9 5,6 10 5 ON 14 8