On cycling in the simplex method of the transportation problem

DOI10.4064/AM36-1-5MaRDI QIDQ3598207zbMATH OpenOpenAlexFDO

Authors Wlodzimierz Szwarc

Publication date 2 February 2009

Published in Applicationes Mathematicae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4064/am36-1-5

zbMATH Keywords

assignment problembasic solutioncyclingdirected weighted treelinknodetransportation problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27)

Recommendations

• Cycling in linear programming problems
• On the cycles generated by an arbitrary set of matrix elements
• Systematic construction of examples for cycling in the simplex method
• The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling
• A note on cycling LP examples with permutation structure

Cited in

(7)

• Cycling can occur in Mráz's algorithm for nonconvex quadratic programming
• Cycling in linear programming problems
• Geometry of the Gass-Saaty parametric cost LP algorithm
• A note on cycling LP examples with permutation structure
• scientific article; zbMATH DE number 4152143 (Why is no real title available?)
• On the cycles generated by an arbitrary set of matrix elements
• Bicycle Routing for Maximum Suntan

This page was built for publication: On cycling in the simplex method of the transportation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3598207)