pushmedia1: When does Simplex get out of hand?

9.22.2004

When does Simplex get out of hand?

In 1972, Klee and Minty gave an example of a linear programming problem in which the polytope P is a distortion of an n-dimensional cube. They showed that the simplex method as formulated by Danzig visits all 2ⁿ vertices before arriving at the optimal vertex.

This is a quote from wikipedia. Maybe I should dig up that paper...

¶ 1:29 AM

Comments: Post a Comment

<< Home

Links to this post:

<$BlogBacklinkTitle$>: <$BlogBacklinkSnippet$>
posted by <$BlogBacklinkAuthor$> @ <$BlogBacklinkDateTime$>

Create a Link