Page 2 of 2 Part III: Assignment/Transportation Problem. Let’s consider the assignment problem having the following cost table: a. Determine the linear programming model formulation to minimize the total assignment cost. b. Use the Hungarian method to find an optimal solution. c. Reformulate this as an equivalent transportation problem (i.e., construct transportation problem tableau). d. Use the Northwest Corner Method to obtain an initial basic feasible solution. (This will be a degenerate solution. Be sure to specify which variables are basic!) e. Use the transportation simplex method to find the optimal solution (2 points).
Call Us: USA +1 862 207 3288