subject to we noted that the maximum flow problem translates quite directly into a linear program: max fe subject to e 8+ (s) f - fe = 0 e 8-(v) eE8+ (v) fe ue fe 20 PEP:eEP (As usual, we are assuming that s has no incoming edges.) In Lecture #8 we considered the following alternative linear program, where P denotes the set of s-t paths of G: max fp PEP fpsue for all us, t for all e E E for all e E. for all e E fp 20 for all PEP. Prove that these two linear programs always have equal optimal objective function value. Acti Go to