The Gomory-Chvátal closure of a non-rational polytope is a rational polytope
The question as to whether the Gomory-Chvátal 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.
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute for Operations Research and the Management Sciences (INFORMS)
2013
|
| Online Access: | http://hdl.handle.net/1721.1/77903 https://orcid.org/0000-0002-9595-459X |