LP duality in infinite hypergraphs (Q803165): Difference between revisions

A hypergraph has the strong duality property if it has a fractional matching and a fractional cover satisfying the complementary slackness conditions of linear programming. The authors prove that all graphs satisfy the strong duality property; then, they consider the duality property for families of intervals on the real line and obtain an extension of Gallai's theorem.