Comments on: Dantzig and Simplex http://magic.aladdin.cs.cmu.edu/2005/09/27/dantzig-and-simplex/ Algorithms are everywhere. Sun, 30 Aug 2009 23:42:14 -0400 http://wordpress.org/?v=2.9-rare hourly 1 By: mohits http://magic.aladdin.cs.cmu.edu/2005/09/27/dantzig-and-simplex/comment-page-1/#comment-132 mohits Wed, 28 Sep 2005 02:38:32 +0000 http://magic.aladdin.cs.cmu.edu/?p=171#comment-132 The Lee's construction you describe does reduce the diameter but it wont help you a bit. One of the common features of all simplex methods is that they always montonically increase the objective function. The trick to decrease the diameter introduces a new vertex at which the objective function is value 0. None of the simplex methods will ever go to that vertex and your problem will remain exactly what it was. Mohit The Lee’s construction you describe does reduce the diameter but it wont help you a bit. One of the common features of all simplex methods is that they always montonically increase the objective function. The trick to decrease the diameter introduces a new vertex at which the objective function is value 0. None of the simplex methods will ever go to that vertex and your problem will remain exactly what it was.

Mohit

]]>