b) Build up the linear programming model based on the details given above. We will use the routes with the lowest cost of delivery (The North-West Corner method Or the Least - Cost method) c) Write the map between the factories (supply) and the destination cities (demand) on the tree form. d) Calculate the minimum cost for the given LPP in (a)(discuss your results regarding tothe amount delivered from the sources to the destinations). e) Step2: Go ahead to achieve the complemenatry part ...... 16 b) Build up the linear programming model based on the details given above. We will use the routes with the lowest cost of delivery (The North-West Corner method Or the Least - Cost method) c) Write the map between the factories (supply) and the destination cities (demand) on the tree form. d) Calculate the minimum cost for the given LPP in (a)(discuss your results regarding tothe amount delivered from the sources to the destinations). e) Step2: Go ahead to achieve the complemenatry part ...... 16 Question9: Consider a transportation problem with three sources (rows) and four demands points (columns). The availability in the supply points are 40, 50 and 60, respectively and the requirements are 20, 30, 30 and 50, respectively. Table 2 given below shows that the data including the unit cost of transportation which is shown in left hand corner of the elements of the matrix. Use the Least - Cost method or the North-West Cost method to claculate the minimum cost. Step1: a) Write the table which represents the total available amount from each factory and the maximum load that can be delivered to each city Table 2: Supply Demand Supply B B4 A A 4 6 A3 5 Demand 20 6 8 7 30 B 15 8 50 B3 8 7 8 50 40 60 50 150