A new pivoting rule for solving various degeneracy problems

DOI10.1016/0167-6377(92)90058-BzbMath0767.90045OpenAlexW2084062866MaRDI QIDQ1198621

Ferdinand Geue, Tomas Gal

Publication date: 16 January 1993

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(92)90058-b

zbMATH Keywords

degeneracy graphstransition node pivoting rule

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (12)

Adjacency based method for generating maximal efficient faces in multiobjective linear programming ⋮ Degeneracy subgraph of the Lemke complementary pivot algorithm and anticycling rule ⋮ Weakly redundant constraints and their impact on postoptimal analyses in LP ⋮ Systematic construction of examples for cycling in the simplex method ⋮ Generalized \(\gamma\)-valid cut procedure for concave minimization ⋮ Selected bibliography on degeneracy ⋮ 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 ⋮ An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex ⋮ On some properties of \(0\)-degeneracy graphs ⋮ A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program ⋮ Enumerating extreme points of a highly degenerate polytope

Cites Work

• Unnamed Item
• On the structure of the set bases of a degenerate point
• A general phase-I method in linear programming
• Degeneracy graphs and the neighbourhood problem
• Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
• Survey of solved and open problems in the degeneracy phenomenon
• A dual approach to primal degeneracy
• An improved vertex enumeration algorithm
• Degeneracy graphs and simplex cycling
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• A Note on Shadow Prices in Linear Programming
• A note on degeneracy in linear programming
• On the average length of lexicographic paths
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• An algorithm for determining all extreme points of a convex polytope
• New Finite Pivoting Rules for the Simplex Method
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
• Optimality and Degeneracy in Linear Programming

This page was built for publication: A new pivoting rule for solving various degeneracy problems