| Article ID: | iaor20102859 |
| Volume: | 36 |
| Issue: | 4 |
| Start Page Number: | 414 |
| End Page Number: | 418 |
| Publication Date: | Jul 2008 |
| Journal: | Operations Research Letters |
| Authors: | Terlaky Tams, Nematollahi Eissa |
We have previously shown, by redundant Klee–Minty constructions, that the central path may arbitrarily closely visit every vertex of the Klee–Minty cube. In those constructions, the redundant constraints are far away from the feasible region. In this paper, we provide a construction in which all redundant constraints touch the feasible region.