Does real linear programming produce bipartite perfect matching using maxflow reduction?
質問
Given a bipartite graph the standard reduction to max flow is with the construction similar to following diagram:
We can formulate max flow as an linear programming problem with integer variables in latter.
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?
Is there a formal proof of this?
正しい解決策はありません
所属していません cs.stackexchange