The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4
暂无分享,去创建一个
We exhibit a d -polytope P with n facets and a linear form (phi) such that all paths from a certain vertex of P to a (phi)-minimizing vertex that are nonincreasing in (phi) have length at least n - d + 1, provided d (ge) 4 and n - d (ge) 4. Indeed the discrepancy between the minimum length of such paths and n - d is at least min{[ d /4], [( n - d )/4]} for some such polytope.
[1] Robert G. Jeroslow,et al. The simplex algorithm with the pivot rule of maximizing criterion improvement , 1973, Discret. Math..
[2] V. Klee,et al. Thed-step conjecture for polyhedra of dimensiond<6 , 1967 .
[3] V. Klee. Paths on Polyhedra. I , 1965 .
[4] G. Dantzig,et al. Linear Programming and Its Extensions. , 1966 .
[5] V. Klee,et al. HOW GOOD IS THE SIMPLEX ALGORITHM , 1970 .