A dual approach to primal degeneracy

DOI10.1007/BF01589398zbMath0643.90053MaRDI QIDQ1102188

Julia Wilson, Bob Hattersley

Publication date: 1988

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

zbMATH Keywords

degeneracycyclingdual approachcirclingdual infeasibilitypurification algorithmRevised Primal Simplex algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (11)

The positive edge pricing rule for the dual simplex ⋮ A projective simplex algorithm using LU decomposition ⋮ A new pivoting rule for solving various degeneracy problems ⋮ A primal deficient-basis simplex algorithm for linear programming ⋮ A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses ⋮ A basis-defiency-allowing variation of the simplex method for linear programming ⋮ Selected bibliography on degeneracy ⋮ Degeneracy graphs: Theory and applications. An updated survey ⋮ Pivot rules for linear programming: A survey on recent theoretical developments ⋮ Encounters with degeneracy: A personal view ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis

Uses Software

• SCICONIC
• DEVEX

Cites Work

• Unnamed Item
• Unnamed Item
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• New Finite Pivoting Rules for the Simplex Method
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method
• A Technique for Resolving Degeneracy in Linear Programming
• Optimality and Degeneracy in Linear Programming

This page was built for publication: A dual approach to primal degeneracy