Article ID Journal Published Year Pages File Type
1143058 Operations Research Letters 2008 5 Pages PDF
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A redundant Klee-Minty construction with all the redundant constraints touching the feasible region
Authors
, ,