Degeneracy in the presence of roundoff errors

DOI10.1016/0024-3795(88)90026-2zbMath0649.65032OpenAlexW2020799833MaRDI QIDQ1105984

Roger Fletcher

Publication date: 1988

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(88)90026-2

zbMATH Keywords

numerical examplesdegeneracysimplex methodroundoff errorsinexact arithmetic\(\ell 1\) approximation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Algorithms for approximation of functions (65D15) Approximation by arbitrary linear expressions (41A45)

Related Items

Resolving degeneracy in quadratic programming ⋮ On degeneracy in linear programming and related problems

Uses Software

• DEVEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A penalty linear programming method using reduced-gradient basis-exchange techniques
• Complementary pivot theory of mathematical programming
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• Stable modification of explicitLU factors for simplex updates
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• Linear Programming via a Nondifferentiable Penalty Function
• Occurrences of cycling and other phenomena arising in a class of linear programming models
• Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
• New Finite Pivoting Rules for the Simplex Method
• A Technique for Resolving Degeneracy in Linear Programming
• The Composite Simplex Algorithm
• A complete constructive algorithm for the general mixed linear programming problem
• Pivot selection methods of the Devex LP code
• An Improved Algorithm for Discrete $l_1 $ Linear Approximation
• Optimality and Degeneracy in Linear Programming