(Termination Tolerance for Transportation Problems) Consider a transportation problem with m sources and n sinks, and integer data. Show that in order for a feasible x to be optimal it is sufficient that it satisfies -CS together with some p and that
![](https://test.transtutors.com/qimg/cc4498a3-944e-4ad4-bae9-05e2f9a76311.png)