2. (a) Give a linear-programming formulation of the bipartite maximum matching problem. The input is a...

Transcribed Image Text:

2. (a) Give a linear-programming formulation of the bipartite maximum matching problem. The input is a bipartite graph G = (UUV; E), where ECU XV; the output is the largest matching in G. Your linear program should have one variable for each edge. (b) Now dualize the linear program from part (a). What do the dual variables represent? What does the objective function represent? What problem is this!? 2. (a) Give a linear-programming formulation of the bipartite maximum matching problem. The input is a bipartite graph G = (UUV; E), where ECU XV; the output is the largest matching in G. Your linear program should have one variable for each edge. (b) Now dualize the linear program from part (a). What do the dual variables represent? What does the objective function represent? What problem is this!? 2. (a) Give a linear-programming formulation of the bipartite maximum matching problem. The input is a bipartite graph G = (UUV; E), where ECU XV; the output is the largest matching in G. Your linear program should have one variable for each edge. (b) Now dualize the linear program from part (a). What do the dual variables represent? What does the objective function represent? What problem is this!? 2. (a) Give a linear-programming formulation of the bipartite maximum matching problem. The input is a bipartite graph G = (UUV; E), where ECU XV; the output is the largest matching in G. Your linear program should have one variable for each edge. (b) Now dualize the linear program from part (a). What do the dual variables represent? What does the objective function represent? What problem is this!?

Answer rating: 100% (QA)

Linear Programming Formulation of the Bipartite Maximum Matching Problem Input A bipartite graph GUVE where U and V are disjoint sets of vertices and E is a set of edges connecting vertices in U to ve... View the full answer