Degeneracy degrees of constraint collections

DOI10.1007/s001860200259zbMath1175.90292OpenAlexW2096579819MaRDI QIDQ1423697

Gert A. Tijssen, Gerard Sierksma

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)

Related Items

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 ⋮ The maximal descriptor index set for a face of a convex polyhedral set and some applications