Klee-Minty Cube

Klee-Minty Cube

Edited by 

List price: US$55.00

Currently unavailable

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks


Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The Klee-Minty cube (named after Victor Klee and George J. Minty) is a unit cube whose corners have been slightly perturbed. Klee and Minty demonstrated that Dantzig's simplex algorithm has poor worst-case performance when initialized at one corner of their "squashed cube." In particular, many optimization algorithms for linear optimization exhibit poor performance when applied to the Klee-Minty cube. In 1973 Klee and Minty showed that Dantzig's simplex algorithm was not a polynomial-time algorithm when applied to their cube. Later, modifications of the Klee-Minty cube have shown poor behavior both for other basis-exchange pivoting algorithms and also for interior-point algorithms.show more

Product details

  • Paperback | 120 pages
  • 152 x 229 x 7mm | 186g
  • Miss Press
  • United States
  • English
  • black & white illustrations
  • 6136778017
  • 9786136778013