An algorithm to find the lineality space of the positive hull of a set of vectors
type: Item
instance of: scholarly article
title: An algorithm to find the lineality space of the positive hull of a set of vectors
zbMATH Open document ID: 1235.52024
author: Francisco J. López
published in: JMMA. Journal of Mathematical Modelling and Algorithms
publication date: 2012-02-21T00:00:00Z
Mathematics Subject Classification ID: 52B55
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 6008307
zbMATH Keywords: convex analysis
zbMATH Keywords: facial decomposition
zbMATH Keywords: linear programming
zbMATH Keywords: lineality space
zbMATH Keywords: polyhedral set theory
zbMATH Keywords: positive hulls
describes a project that uses: IMSL Numerical Libraries
MaRDI profile type: Publication
full work available at URL: s10852-010-9133-1
OpenAlex ID: W2033132340
cites work: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
cites work: The generation of convex hulls
cites work: Theory of Positive Linear Dependence
cites work: The extended linear complementarity problem
cites work: Minimal realization in the max algebra is an extended linear complementarity problem
cites work: Geometry of optimal value functions with applications to redundancy in linear programming
cites work: An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull
cites work: Algorithms for the frame of a finitely generated unbounded polyhedron
cites work: Brick decompositions and the matching rank of graphs
cites work: Cross-positive matrices revisited
cites work: Q5817857
cites work: Q3134498
cites work: Convex Analysis
cites work: Q4221106
cites work: Preprocessing in Stochastic Programming: The Case of Linear Programs
cites work: Algorithms for frames and lineality spaces of cones
cites work: Towards an algebraic characterization of convex polyhedral cones
DOI: 10.1007/S10852-010-9133-1
Recommended article: A linear algorithm for computing convex hulls for random lines
Recommended article: An algorithm for computing the hull of the solution set of interval linear equations
Recommended article: Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
Recommended article: LATIN 2004: Theoretical Informatics
Recommended article: A linear algorithm for determining the separation of convex polyhedra
Recommended article: Q3318142
Recommended article: Computing convex hulls with a linear solver
Recommended article: Hulls and Efficient Sets for the Rectilinear Norm
Recommended article: A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS
description: scientific article; zbMATH DE number 6008307