On cycling in the simplex method of
the transportation problem
Applicationes Mathematicae, Tome 36 (2009) no. 1, pp. 59-73
Cet article a éte moissonné depuis la source Institute of Mathematics Polish Academy of Sciences
This paper shows that cycling of the simplex method for the $m\times 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\times k$ assignment problem. A method to disprove cycling for a particular $k$ is applied for $k=2,3,4,5$ and $6$.
Keywords:
paper shows cycling simplex method times transportation problem where k zero basic variables leaving reentering basis does occur once does occur times assignment problem method disprove cycling particular applied
Affiliations des auteurs :
W/lodzimierz Szwarc  1
@article{10_4064_am36_1_5,
author = {W/lodzimierz Szwarc},
title = {On cycling in the simplex method of
the transportation problem},
journal = {Applicationes Mathematicae},
pages = {59--73},
year = {2009},
volume = {36},
number = {1},
doi = {10.4064/am36-1-5},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.4064/am36-1-5/}
}
W/lodzimierz Szwarc. On cycling in the simplex method of the transportation problem. Applicationes Mathematicae, Tome 36 (2009) no. 1, pp. 59-73. doi: 10.4064/am36-1-5
Cité par Sources :