Ordinarily the minimum cost method is used to find an initial basic feasible solution for a balanced transportation problem when we are minimizing the objective function. Assume the goal of the problem is to maximize the objective function. Modify the minimum cost method for maximizing to find an initial basic feasible solution to the balanced transportation problem below. 16 14 12 s1=50 13 19 13 s2=50 17 15 18 s3=20 d1=40 d2=70 d3=10 Is this basic feasible solution optimal? If yes, you are done. If no, place the next basic feasible solution in the transportation simplex method below. Remember you are maximizing so the optimality condition will have to be modified. 16 14 12 s1=50 13 19 13 s2=50 17 15 18 s3=20 d1=40 d2= 70 d3=10