On degeneracy in linear programming and related problems

DOI10.1007/BF02023104zbMath0787.90048OpenAlexW2093642032MaRDI QIDQ1312772

Karen George, Michael R. Osborne

Publication date: 7 February 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02023104

zbMATH Keywords

steepest descentdegeneracyprojected gradient algorithm\(l_ 1\) estimationdegenerate active sets

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

Analytical aspects of tie breaking

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degeneracy in the presence of roundoff errors
• On the solution of highly degenerate linear programmes
• Linear programming via least squares
• A practical anti-cycling procedure for linearly constrained optimization
• Resolving degeneracy in quadratic programming
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• On Linear Restricted and Interval Least-Squares Problems
• The $l_1 $ Solution of Linear Equations Subject to Linear Constraints
• An Empirical Quantile Function for Linear Models with | operatornameiid Errors
• A Technique for Resolving Degeneracy in Linear Programming

This page was built for publication: On degeneracy in linear programming and related problems