Pivoting rules and redundancy schemes in extreme point enumeration

DOI10.1007/BF01935004zbMath0574.65058MaRDI QIDQ1063390

Stein W. Wallace

Publication date: 1985

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

extreme pointenumerationconvex polyhedradegeneracy pivoting rulesredundancy schemes

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Enumeration in graph theory (05C30) Polytopes and polyhedra (52Bxx)

Related Items

Enumerative techniques for solving some nonconvex global optimization problems, Enhanced intersection cutting-plane approach for linear complementarity problems, Selected bibliography on degeneracy, Degeneracy graphs: Theory and applications. An updated survey, An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex

Cites Work

• On degeneracy in enumeration
• Ranking of vertices in the linear fractional programming problem
• An improved vertex enumeration algorithm
• Finding all vertices of a convex polyhedron
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• An Algorithm for Finding All Vertices of Convex Polyhedral Sets
• 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
• Solving the Fixed Charge Problem by Ranking the Extreme Points
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
• Optimality and Degeneracy in Linear Programming