Survey of solved and open problems in the degeneracy phenomenon

DOI10.1007/BF01589397MaRDI QIDQ1101009zbMATH OpenFDO

Authors Tomas Gal, Peter Zörnig, Hermann-Josef Kruse

Publication date 1988

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

sensitivityall vertices of a convex polytopecycling of the simplex methoddegeneracy graphminimal N-treeneighbourhood problemshadow prices determinationweakly redundant constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Sensitivity, stability, parametric optimization (90C31) Polytopes and polyhedra (52Bxx)

Recommendations

• Degeneracy graphs: Theory and applications. An updated survey
• Degeneracy graphs and simplex cycling
• Degeneracy in the presence of roundoff errors
• scientific article; zbMATH DE number 1163805
• scientific article; zbMATH DE number 3852781

Cites work

• scientific article; zbMATH DE number 3626518 (Why is no real title available?)
• scientific article; zbMATH DE number 3634009 (Why is no real title available?)
• A Note on Shadow Prices in Linear Programming
• A Technique for Resolving Degeneracy in Linear Programming
• An analysis of degeneracy
• Convex Polytopes
• Degeneracy graphs and the neighbourhood problem
• New Finite Pivoting Rules for the Simplex Method
• Occurrences of cycling and other phenomena arising in a class of linear programming models
• On the structure of the set bases of a degenerate point
• Optimality and Degeneracy in Linear Programming
• Redundancy in mathematical programming. A state-of-the-art survey
• Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
• The Computation of Shadow Prices in Linear Programming
• The generalized simplex method for minimizing a linear form under linear inequality restraints

Cited in

(24)

• Sensitivity analysis of the optimal assignment.
• An exploratory computational analysis of dual degeneracy in mixed-integer programming
• Degeneracy degrees of constraint collections
• Approaches to sensitivity analysis in linear programming
• Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
• scientific article; zbMATH DE number 4114364 (Why is no real title available?)
• Systematic construction of examples for cycling in the simplex method
• On the connectedness of optimum-degeneracy graphs
• On some properties of \(0\)-degeneracy graphs
• Bounds on the number of vertices of perturbed polyhedra
• Small degenerate simplices can be bad for simplex methods
• An analysis of degeneracy
• A note on degeneracy in linear programming
• Degeneracy graphs: Theory and applications. An updated survey
• On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
• scientific article; zbMATH DE number 3896665 (Why is no real title available?)
• Selected bibliography on degeneracy
• Weakly redundant constraints and their impact on postoptimal analyses in LP
• 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 subgraph of the Lemke complementary pivot algorithm and anticycling rule
• Degenerate optimal basis graphs in linear programming
• Degeneracy in transportation problems

This page was built for publication: Survey of solved and open problems in the degeneracy phenomenon

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