An algorithm to decide if the intersection of convex polyhedral cones has a non empty interior

DOI10.1007/BF01932729zbMath0377.52007OpenAlexW2092413307MaRDI QIDQ4157267

Louis Paquette, Marcel Boyer

Publication date: 1976

Published in: BIT (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithms in computer science (68W99) Polytopes and polyhedra (52Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for finding a vector in the intersection of open convex polyhedral cones

This page was built for publication: An algorithm to decide if the intersection of convex polyhedral cones has a non empty interior