## Samenvatting

For a polytope P, the Chvátal closure P0 P is obtained by simultaneously strengthening all feasible inequalities cx 6 (with integral c) to cx 6 bc. The number of iterations of this procedure that are needed until the integral hull of P is reached is called the Chvátal rank. If P 0; 1=n, then it is known that On2 log n iterations always suffice and at least 1+1e o1n iterations are sometimes needed, leaving a huge gap between lower and upper bounds. We prove that there is a polytope contained in the 0/1 cube that has Chvátal rank n2, closing the gap up to a logarithmic factor. In fact, even a superlinear lower bound was mentioned as an open problem by several authors. Our choice of P is the convex hull of a semi-random Knapsack polytope and a single fractional vertex. The main technical ingredient is linking the Chvátal rank to simultaneous Diophantine approximations w.r.t. the k k1-norm of the normal vector defining P.

Originele taal-2 | Engels |
---|---|

Pagina's (van-tot) | 212-220 |

Aantal pagina's | 9 |

Tijdschrift | Operations Research |

Volume | 65 |

Nummer van het tijdschrift | 1 |

DOI's | |

Status | Gepubliceerd - 1 jan. 2017 |

Extern gepubliceerd | Ja |