Q: Solve transportation: supplies [10,10], demands [8,12], costs [[2,3],[4,1]]. Balanced: 20 = 20 ✓. NW corner: x₁₁ = min(10,8) = 8; x₁₂ = 2; x₂₂ = 10. Cost: 8(2)+2(3)+10(1) = 16+6+10 = 32. Optimal? MODI/u-v: check: likely x₁₁=8, x₁₂=2, x₂₂=10 optimal (cheap 1 used max!). Total: 32! (Ship cheap routes max!)