A note on degeneracy in linear programming
From MaRDI portal
Recommendations
Cites work
Cited in
(17)- Removing degeneracy in LP-type problems revisited
- On the convexity of the multiplicative version of Karmarkar's potential function
- A new pivoting rule for solving various degeneracy problems
- Selected bibliography on degeneracy
- Degeneracy graphs: Theory and applications. An updated survey
- Learning in experimental games
- Degenerate optimal basis graphs in linear programming
- On the \(\epsilon\)-perturbation method for avoiding degeneracy
- An experimental study of constant-sum centipede games
- Men and progress in linear programming
- On the average length of lexicographic paths
- scientific article; zbMATH DE number 4114364 (Why is no real title available?)
- scientific article; zbMATH DE number 854120 (Why is no real title available?)
- Revisiting degeneracy, strict feasibility, stability, in linear programming
- Degeneracy resolution for bilinear utility functions
- On the number of degenerate simplex pivots
- On the number of degenerate simplex pivots
This page was built for publication: A note on degeneracy in linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3730338)