On cycling in the simplex method of the Transportation Problem
This paper shows that cycling of the simplex method for the mÃ—n Transportation Problem where k-1 zero basic variables are leaving and reentering the basis does not occur once it does not occur in the kÃ—k Assignment Problem. A method to disprove cycling for a particular k is applied for k=2,3,34,5 and 6.
|Date of creation:||01 Jan 2008|
|Date of revision:|
|Contact details of provider:|| Postal: Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium)|
Fax: +32 10474304
Web page: http://www.uclouvain.be/core
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:cor:louvco:2008003. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Alain GILLIS)
If references are entirely missing, you can add them using this form.