Degeneracy graphs and simplex cycling

From MaRDI portal

Revision as of 05:33, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1189552

Jump to:navigation, search

zbMath0790.90051MaRDI QIDQ1189552

Peter Zörnig

Publication date: 18 September 1992

Published in: Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)

zbMATH Keywords

diameter connectivity degeneracy linear inequality systems degeneracy graphs cycling examples

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05)

Related Items (10)

On the line graphs of the complete \(r\)-partite graphs ⋮ On Hoffman's celebrated cycling LP example ⋮ A note on cycling LP examples with permutation structure ⋮ A new pivoting rule for solving various degeneracy problems ⋮ Systematic construction of examples for cycling in the simplex method ⋮ On the connectedness of optimum-degeneracy graphs ⋮ Selected bibliography on degeneracy ⋮ Degeneracy graphs: Theory and applications. An updated survey ⋮ An effective non-Archimedean anti-degeneracy/cycling linear programming method especially for data envelopment analysis and like models ⋮ A theory of degeneracy graphs

This page was built for publication: Degeneracy graphs and simplex cycling

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1189552&oldid=13250476"