<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Hirsch conjecture - Page 3 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Hirsch_conjecture&amp;p=2">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Hirsch_conjecture&amp;p=4">3.Next</a>
</p>
<p>as the diameter of a polytope provides a lower bound on the number of steps needed by the simplex method.  The conjecture is now known to be false in general.</p>

<p>The Hirsch conjecture was proven for d < 4 and for various special cases, while the best known upper bounds on the diameter are only sub-exponential in n</i> and d. After more than fifty years, a counter-example was announced in May 2010 by <a href="page.php?w=Francisco_Santos_Leal">Francisco Santos Leal</a>, from the <a href="page.php?w=University_of_Cantabria">University of Cantabria</a>. The result was presented at the conference 100 Years in Seattle: the mathematics of <a href="page.php?w=Victor_Klee">Klee</a> and <a href="page.php?w=Branko_Gr%C3%BCnbaum">Grünbaum</a> and appeared in <a href="page.php?w=Annals_of_Mathematics">Annals of Mathematics</a>. Specifically, the paper presented a 43-dimensional polytope of 86 facets with a diameter of more than 43. The counterexample has no direct consequences for the analysis of the simplex method, as it does not rule out the possibility of a larger but still linear or polynomial number of steps.</></p><p>
<a accesskey="1" href="page.php?w=Hirsch_conjecture&amp;p=2">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Hirsch_conjecture&amp;p=4">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
