论文信息 - The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope

The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope

The question as to whether the Gomory-Chvatal closure of a nonrational polytope is a polytope has been a longstanding open problem in integer programming. In this paper, we answer this question in the affirmative by combining ideas from polyhedral theory and the geometry of numbers.

Andreas S. Schulz | Juliane Dunkel | J. Dunkel

[1] Alexander Schrijver,et al. On Cutting Planes , 1980 .

[2] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .

[3] Gérard Cornuéjols,et al. Valid inequalities for mixed integer linear programs , 2007, Math. Program..

[4] Daniel Dadush,et al. The Chvátal-Gomory Closure of a Strictly Convex Body , 2011, Math. Oper. Res..

[5] Ralph E. Gomory,et al. An algorithm for integer solutions to linear programs , 1958 .

[6] Juan Pablo Vielma,et al. The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron , 2010, IPCO.

[7] S. Halfin. Arbitrarily Complex Corner Polyhedra are Dense in $R^n $ , 1972 .

[8] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[9] Daniel Dadush,et al. On the Chvátal–Gomory closure of a compact convex set , 2010, Math. Program..

[10] Juliane Dunkel,et al. The Gomory-Chvátal closure : polyhedrality, complexity, and extensions , 2011 .

[11] Vasek Chvátal,et al. Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

[12] Alexander Barvinok,et al. A course in convexity , 2002, Graduate studies in mathematics.