problem for the following problem. Solve the dual problem graphically Max. 3x1 +2 x2 to: 2 x1+2 x2 S5 2x1+x2 (resource 1) (resource 2) 4 ? x1 + 2 x2 4 (resource 3) x1, x2 2 0 2. Consider the following transportation table for a minimization problem. Obtain a basic feasible solution for the given transportation using Minimum cost methods.or Supply 60 170 2 Demand 100 60 40 20 DC onsider the assignme nt problem having the following cost Table. Draw the network representation nment problem. Solve the problem using Hungarian method Task 4ture 2 3 5 8 8 9 7 Assignment B 7 ? 13 D 5 7 problem for the following problem. Solve the dual problem graphically Max. 3x1 +2 x2 to: 2 x1+2 x2 S5 2x1+x2 (resource 1) (resource 2) 4 ? x1 + 2 x2 4 (resource 3) x1, x2 2 0 2. Consider the following transportation table for a minimization problem. Obtain a basic feasible solution for the given transportation using Minimum cost methods.or Supply 60 170 2 Demand 100 60 40 20 DC onsider the assignme nt problem having the following cost Table. Draw the network representation nment problem. Solve the problem using Hungarian method Task 4ture 2 3 5 8 8 9 7 Assignment B 7 ? 13 D 5 7