On cycling in the simplex method of the Transportation Problem

Wlodzimierz Szwarc
Additional contact information
Wlodzimierz Szwarc: University of Wisconsin-Milwaukee

No 2008003, LIDAM Discussion Papers CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)

Abstract: 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.

Keywords: Transportation Problem; Assignment Problem; cycling; basic solution; node; link; directed weighted tree. (search for similar items in EconPapers)
Date: 2008-01-01
References: Add references at CitEc
Citations:

Downloads: (external link)
https://sites.uclouvain.be/core/publications/coredp/coredp2008.html (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cor:louvco:2008003

Access Statistics for this paper

More papers in LIDAM Discussion Papers CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium). Contact information at EDIRC.
Bibliographic data for series maintained by Alain GILLIS ().