Optimization Online


An improved Kalai-Kleitman bound for the diameter of a polyhedron

Michael J. Todd (mjt7***at***cornell.edu)

Abstract: Kalai and Kleitman established the bound $n^{\log(d) + 2}$ for the diameter of a $d$-dimensional polyhedron with $n$ facets. Here we improve the bound slightly to $(n-d)^{\log(d)}$.

Keywords: convex polyhedra, diameter

Category 1: Linear, Cone and Semidefinite Programming (Linear Programming )

Citation: School of Operations Research and Information Engineering, Cornell University, Ithaca NY, USA, February 2014

Download: [PDF]

Entry Submitted: 02/14/2014
Entry Accepted: 02/14/2014
Entry Last Modified: 03/20/2014

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society