Degeneracy degrees of constraint collections

DOI10.1007/S001860200259MaRDI QIDQ1423697zbMATH OpenOpenAlexFDO

Authors Gerard Sierksma, Gert A. Tijssen

Publication date 7 March 2004

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://pure.rug.nl/ws/files/3195818/97a50.pdf

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Recommendations

• Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces
• Survey of solved and open problems in the degeneracy phenomenon
• scientific article; zbMATH DE number 854120
• Degeneracy in interior point methods for linear programming: A survey
• Degeneracy in NLP and the development of results motivated by its presence

Cited in

(7)

• Degeneracy in NLP and the development of results motivated by its presence
• Degeneracy in interior point methods for linear programming: A survey
• The maximal descriptor index set for a face of a convex polyhedral set and some applications
• An analysis of degeneracy
• Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution
• Minimal representations of a face of a convex polyhedron and some applications
• A new method for determining all maximal efficient faces in multiple objective linear programming

This page was built for publication: Degeneracy degrees of constraint collections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1423697)