Consider the following transportation table:

$\backslash$table$[[$Origin$,$Destination,Supply$],[1,2,3,],[2,3,5,1,300],[3,3,1,8,400],[$Demand$,250,6,2,500]]$

Find an initial feasible solution using Vogel's Method

Again, the table must be balanced before you can proceed.

Verify this solution is optimal.