A note on cycling LP examples with permutation structure

A note on cycling LP examples with permutation structure

0.00 Avg rating0 Votes
Article ID: iaor20091393
Country: United Kingdom
Volume: 35
Issue: 3
Start Page Number: 994
End Page Number: 1002
Publication Date: Mar 2008
Journal: Computers and Operations Research
Authors:
Abstract:

We study a particular class of cycling examples for the simplex algorithm which is characterized by a permutation structure, i.e. after a few iterations the simplex tableau is a column permutation of the initial tableau. Developing some matrix theory, among others, we formulate necessary and sufficient conditions, characterizing cycling examples with this structure and give some numerical examples. Hoffman's cycling example turns out to be a special member of this class. The answers on some related questions, studied very recently by Guerrero-Garcia and Santos-Palomo can be easily obtained in terms of the general framework.

Reviews

Required fields are marked *. Your email address will not be published.