• Here is the bipartite matching example we discussed in class.

• This file can be used to find all of the vertices (solutions). Run with

  lrs < bipartite.ine

• It turns out there are only two vertices, both integer.

    1  1  0  0  1  1  1  0 
    1  0  1  1  0  1  0  1

• Solving with a uniform objective, and choosing --interior with glpsol, we get the non-integer optimal solution

    x[1,A].val = 0.5
    x[1,B].val = 0.5
    x[2,A].val = 0.5
    x[2,D].val = 0.5
    x[3,C].val = 1.0
    x[4,B].val = 0.5
    x[4,D].val = 0.5

• This can be visualized as dot and pdf.