LP duality in infinite hypergraphs (Q803165)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4200252
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | LP duality in infinite hypergraphs |
scientific article; zbMATH DE number 4200252 |
Statements
LP duality in infinite hypergraphs (English)
0 references
1990
0 references
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.
0 references
strong duality property
0 references
fractional matching
0 references
fractional cover
0 references
complementary slackness conditions of linear programming
0 references
Gallai's theorem
0 references
0.8541743159294128
0 references
0.8323653340339661
0 references
0.8114473223686218
0 references
0.7638063430786133
0 references
0.7594154477119446
0 references
