Does real linear programming produce bipartite perfect matching using maxflow reduction?

cs.stackexchange https://cs.stackexchange.com/questions/109743

Question

Given a bipartite graph the standard reduction to max flow is with the construction similar to following diagram:

enter image description here

We can formulate max flow as an linear programming problem with integer variables in latter.

  1. If we do not use integer variables does solving for maxflow in linear programming formulation with only real variables still produce valid perfect matching of given graph?

  2. Is there a formal proof of this?

No correct solution

Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange
scroll top