Survey of solved and open problems in the degeneracy phenomenon
DOI10.1007/BF01589397zbMATH Open0641.90049MaRDI QIDQ1101009FDOQ1101009
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)
Recommendations
sensitivityall vertices of a convex polytopecycling of the simplex methoddegeneracy graphminimal N-treeneighbourhood problemshadow prices determinationweakly redundant constraints
Numerical mathematical programming methods (65K05) Linear programming (90C05) Sensitivity, stability, parametric optimization (90C31) Polytopes and polyhedra (52Bxx)
Cites Work
- New Finite Pivoting Rules for the Simplex Method
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- Optimality and Degeneracy in Linear Programming
- Convex Polytopes
- Title not available (Why is that?)
- Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
- Redundancy in mathematical programming. A state-of-the-art survey
- An analysis of degeneracy
- A Technique for Resolving Degeneracy in Linear Programming
- A Note on Shadow Prices in Linear Programming
- The Computation of Shadow Prices in Linear Programming
- Title not available (Why is that?)
- On the structure of the set bases of a degenerate point
- Degeneracy graphs and the neighbourhood problem
- Occurrences of cycling and other phenomena arising in a class of linear programming models
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
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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)
