• Support PF! Buy your school textbooks, materials and every day products Here!

Is there a method for the simplex algorithm that avoids cycling?

  • #1

Homework Statement



"There exists an implementation of the simplex algorithm that avoids cycling. (If your
answer is `yes', describe the strategy; if your answer is `no' give an example and explain
briefly why every strategy must fail.)"

The Attempt at a Solution



We normally do the simplex algorithm using the largest coefficient rule for the entering variable.

I would assume that to avoid cycling, we simply change this to another procedure, although I have tried to research this in both a book I have here and on the internet to no avail... I'm not sure how to go about doing this question! :(
 

Answers and Replies

  • #2
Ray Vickson
Science Advisor
Homework Helper
Dearly Missed
10,706
1,728
Look up "lexicographic ordering" and "Bland's Rule".

RGV
 

Related Threads on Is there a method for the simplex algorithm that avoids cycling?

  • Last Post
Replies
5
Views
8K
Replies
3
Views
3K
Replies
5
Views
827
Replies
19
Views
2K
  • Last Post
Replies
2
Views
994
Replies
8
Views
2K
  • Last Post
Replies
5
Views
1K
  • Last Post
Replies
4
Views
1K
  • Last Post
Replies
2
Views
2K
  • Last Post
Replies
1
Views
2K
Top