An algorithm to find the lineality space of the positive hull of a set of vectors

DOI10.1007/s10852-010-9133-1zbMath1235.52024OpenAlexW2033132340MaRDI QIDQ662122

Francisco J. López

Publication date: 21 February 2012

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-010-9133-1

zbMATH Keywords

linear programmingconvex analysisfacial decompositionlineality spacepolyhedral set theorypositive hulls

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Linear programming (90C05)

Uses Software

• IMSL Numerical Libraries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal realization in the max algebra is an extended linear complementarity problem
• Brick decompositions and the matching rank of graphs
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• Geometry of optimal value functions with applications to redundancy in linear programming
• Cross-positive matrices revisited
• The extended linear complementarity problem
• The generation of convex hulls
• Towards an algebraic characterization of convex polyhedral cones
• Algorithms for the Frame of a Finitely Generated Unbounded Polyhedron
• Preprocessing in Stochastic Programming: The Case of Linear Programs
• An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull
• Algorithms for frames and lineality spaces of cones
• Convex Analysis
• Theory of Positive Linear Dependence