On cycling in the simplex method of the transportation problem

• Autorzy: Włodzimierz Szwarc
• Języki publikacji: EN

Abstrakty

EN

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,4,5 and 6.

Kategorie tematyczne

• 90C08: Special problems of linear programming (transportation, multi-index, etc.)
• 90C05: Linear programming
• 90C27: Combinatorial optimization

• Wydawca: Institute of Mathematics Polish Academy of Sciences
• Czasopismo: Applicationes Mathematicae
• Rocznik: 2009
• Tom: 36
• Numer: 1
• Strony: 59-73

Daty

wydano

2009

Twórcy

autor

Włodzimierz Szwarc

• School of Business Administration, University of Wisconsin-Milwaukee, Milwaukee, WI 53201, U.S.A.

Identyfikatory

DOI

10.4064/am36-1-5