This problem can also be formulated as a LP problem, so it can be solved by the simplex method, however, using Augmenting Path Algorithm is easier.

• 此问题可转化为线性规划模式，所以可用简形法求解，但是用此章的解法较简单。