Abstract
The curvature of a polytope, defined as the largest possible total curvature of the associated central path, can be regarded as a continuous analogue of its diameter. We prove an analogue of the result of Klee and Walkup. Namely, we show that if the order of the curvature is less than the dimension d for all polytopes defined by 2d inequalities and for all d, then the order of the curvature is less that the number of inequalities for all polytopes.
Article PDF
Similar content being viewed by others
References
Dantzig, G.: Linear Programming and Extensions. Princeton University Press, Princeton (1963)
Dedieu, J.-P., Malajovich, G., Shub, M.: On the curvature of the central path of linear programming theory. Found. Comput. Math. 5, 145–171 (2005)
Deza, A., Terlaky, T., Zinchenko, Y.: Central path curvature and iteration-complexity for redundant Klee–Minty cubes. In: Gao D. and Sherali H. (eds.) Advances in Mechanics and Mathematics, vol. III, pp. 215–248 (2007)
Deza, A., Terlaky, T., Zinchenko, Y.: Polytopes and arrangements: diameter and curvature. Oper. Res. Lett. 36-2, 215–222 (2008)
Fritzsche, K., Holt, F.: More polytopes meeting the conjectured Hirsch bound. Discrete Math. 205, 77–84 (1999)
Holt, F., Klee, V.: Many polytopes meeting the conjectured Hirsch bound. Discrete Comput. Geom. 20, 1–17 (1998)
Grünbaum, B.: Convex Polytopes. In: Kaibel, V., Klee, V., Ziegler, G. (eds.) Graduate Texts in Mathematics. vol. 221. Springer, Berlin (2003)
Kalai, G., Kleitman, D.: A quasi-polynomial bound for the diameter of graphs of polyhedra. Bull. Am. Math. Soc. 26, 315–316 (1992)
Klee, V., Walkup, D.: The d-step conjecture for polyhedra of dimension d<6. Acta Math. 133, 53–78 (1967)
Renegar, J.: A Mathematical View of Interior-Point Methods in Convex Optimization. SIAM, Philadelphia (2001)
Roos, C., Terlaky, T., Vial, J.-Ph.: Interior Point Methods for Linear Optimization. Springer, Berlin (2006)
Sonnevend, G., Stoer, J., Zhao, G.: On the complexity of following the central path of linear programs by linear extrapolation II. Math. Program. 52(1–3), 527–553 (1991)
Spivak, M.: Comprehensive Introduction to Differential Geometry. Publish or Perish, Houston (1990)
Ziegler, G.: Lectures on Polytopes, Graduate Texts in Mathematics, vol. 152. Springer, Berlin (1995)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Deza, A., Terlaky, T. & Zinchenko, Y. A Continuous d-Step Conjecture for Polytopes. Discrete Comput Geom 41, 318–327 (2009). https://doi.org/10.1007/s00454-008-9096-4
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-008-9096-4