A dual approach to primal degeneracy
From MaRDI portal
Publication:1102188
DOI10.1007/BF01589398zbMATH Open0643.90053MaRDI QIDQ1102188FDOQ1102188
Authors: Bob Hattersley, Julia Wilson 
Publication date: 1988
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
- Resolution of the problem of degeneracy in a primal and dual simplex algorithm
- Primal and dual combinatorial dimensions
- scientific article; zbMATH DE number 55952
- A generalization of de Vries duality theorem
- The dual of a strongly prime ideal
- On the principle of degeneration in algebraic geometry
- A refinement of the PRV conjecture
- Decompositions of dual discriminator varieties
- Local convergence of a primal-dual method for degenerate nonlinear programming
- scientific article; zbMATH DE number 6160003
degeneracycyclingdual approachcirclingdual infeasibilitypurification algorithmRevised Primal Simplex algorithm
Cites Work
- New Finite Pivoting Rules for the Simplex Method
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- Optimality and Degeneracy in Linear Programming
- Title not available (Why is that?)
- A Technique for Resolving Degeneracy in Linear Programming
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
- Title not available (Why is that?)
Cited In (13)
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
- A projective simplex algorithm using LU decomposition
- Degeneracy graphs: Theory and applications. An updated survey
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- Encounters with degeneracy: A personal view
- The positive edge pricing rule for the dual simplex
- Pivot rules for linear programming: A survey on recent theoretical developments
- The primal framework. II: Smoothness
- Selected bibliography on degeneracy
- A basis-defiency-allowing variation of the simplex method for linear programming
- A new pivoting rule for solving various degeneracy problems
- On the \(\epsilon\)-perturbation method for avoiding degeneracy
- A primal deficient-basis simplex algorithm for linear programming
Uses Software
This page was built for publication: A dual approach to primal degeneracy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102188)
