Dual consistent systems of linear inequalities and cardinality constrained polytopes
- 172 Downloads
We introduce a concept of dual consistency of systems of linear inequalities with full generality. We show that a cardinality constrained polytope is represented by a certain system of linear inequalities if and only if the systems of linear inequalities associated with the cardinalities are dual consistent. Typical dual consistent systems of inequalities are those which describe polymatroids, generalized polymatroids, and dual greedy polyhedra with certain choice functions. We show that the systems of inequalities for cardinality-constrained ordinary bipartite matching polytopes are not dual consistent in general, and give additional inequalities to make them dual consistent. Moreover, we show that ordinary systems of inequalities for the cardinality-constrained (poly)matroid intersection are not dual consistent, which disproves a conjecture of Maurras, Spiegelberg, and Stephan about a linear representation of the cardinality-constrained polymatroid intersection.
KeywordsDual consistency Linear inequalities Cardinality constrained polytopes Matroids
Mathematics Subject Classification (2010)90C27 15A39 52B40
The first author’s research was supported by JSPS Grant-in-Aid for Scientific Research (B) 25280004. The second author’s research was done when he was working at the Research Institute for Discrete Mathematics, University of Bonn. The present research was partly supported due to the “General Agreement for Cooperation between Hausdorff Center for Mathematics, University of Bonn and Research Institute for Mathematical Sciences, Kyoto University”. The authors thank the two anonymous referees for their useful comments that improved the presentation of this paper.
- 2.Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Guy, R., Hanani, H., Sauer, N., Schönheim, J. (eds.) Proceedings of the Calgary International Conference on Combinatorial Structures and Their Applications. Gordon and Breach, New York, (1970), pp. 69–87; also. In: Combinatorial Optimization-Eureka, You Shrink! (M. Jünger, G. Reinelt and G. Rinaldi, eds., Lecture Notes in Computer Science 2570, Springer, Berlin, 2003), pp. 11–26.Google Scholar
- 4.Fujishige, S.: Submodular Functions and Optimization. (Annals of Discrete Mathematics 58), 2nd edn. Elsevier, NY (2005)Google Scholar
- 5.Grötschel, M.: Cardinality homogeneous set systems, cycles in matroids, and associated polytopes. In: Grötschel, M. (eds.) The sharpest cut. The impact of Manfred Padberg and his work, MPS-SIAM Series on Optimization vol. 4, pp. 199–216 (2004)Google Scholar
- 10.Santos, F.: A counterexample to the Hirsch conjecture. ArXiv:1006.2814v3[math.CO] 8 Nov 2011Google Scholar