Problem 1 An IBF has been obtained using Russell method for a shipping company as shown in Transportation Matrix below. Destination 1 2 2 3 4 5 Supply Source 1 C-16 C-16 c=13 c-22 c=17 50 2 C-14 C-14 C-13 C-19 c-15 60 3 C 19 C19 C20 c 23 C+M 50 C-0 4D) C+M It c-0 50 Demand 30 20 70 30 60 The allocations for IBF are as follows: A(1,3) = 50, A(2,3) - 20,A(2,5) - 40. A(3,1)-30, A(3,2) 20,A(3,4) 0,A(4.4) -30, A (4,5) = 20 Check if IBF is optimal. If not, perform 1 iteration of Transportation Simplex Algorithm. Problem 1 An IBF has been obtained using Russell method for a shipping company as shown in Transportation Matrix below. Destination 1 2 2 3 4 5 Supply Source 1 C-16 C-16 c=13 c-22 c=17 50 2 C-14 C-14 C-13 C-19 c-15 60 3 C 19 C19 C20 c 23 C+M 50 C-0 4D) C+M It c-0 50 Demand 30 20 70 30 60 The allocations for IBF are as follows: A(1,3) = 50, A(2,3) - 20,A(2,5) - 40. A(3,1)-30, A(3,2) 20,A(3,4) 0,A(4.4) -30, A (4,5) = 20 Check if IBF is optimal. If not, perform 1 iteration of Transportation Simplex Algorithm