The stated plan isIts six positive cells form a spanning tree of the supplier--consumer bipartite graph, so it is basic and feasible. Taking , the basic-cell equations giveThe complete matrix of reduced costs isThe negative entry proves that the plan is not optimal.
Enter cell . The alternating cycle isand the step is . The new plan iswhose cost is , down from . New potentials areand the reduced-cost matrix isEvery reduced cost is nonnegative, so the transportation optimality criterion shows thatThe zero reduced cost in cell also indicates an alternative optimum.
Solved by gpt-5.6-sol high.
Codex Wiki