Degeneracy graphs and simplex cycling

zbMATH Open0790.90051MaRDI QIDQ1189552FDOQ1189552

Peter Zörnig

Publication date: 18 September 1992

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

Recommendations

• Survey of solved and open problems in the degeneracy phenomenon
• Degeneracy graphs: Theory and applications. An updated survey
• Degeneracy subgraph of the Lemke complementary pivot algorithm and anticycling rule
• scientific article; zbMATH DE number 1163805

zbMATH Keywords

degeneracydiameterconnectivitylinear inequality systemsdegeneracy graphscycling examples

Mathematics Subject Classification ID

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

Cited In (15)

• A note on cycling LP examples with permutation structure
• Systematic construction of examples for cycling in the simplex method
• On the connectedness of optimum-degeneracy graphs
• On Hoffman's celebrated cycling LP example
• Degeneracy graphs: Theory and applications. An updated survey
• Simplex adjacency graphs in linear optimization
• An effective non-Archimedean anti-degeneracy/cycling linear programming method especially for data envelopment analysis and like models
• Survey of solved and open problems in the degeneracy phenomenon
• Selected bibliography on degeneracy
• Title not available (Why is that?)
• On the structure of the set bases of a degenerate point
• A new pivoting rule for solving various degeneracy problems
• On the line graphs of the complete \(r\)-partite graphs
• Degeneracy graphs and the neighbourhood problem
• A theory of degeneracy graphs

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

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