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

DOI10.1007/BF01933529zbMath0252.65050MaRDI QIDQ5666081

Sverre Storøy

Publication date: 1973

Published in: BIT (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Linear inequalities of matrices (15A39) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (3)

Decomposed enumeration of extreme points in the linear programming problem ⋮ An algorithm to decide if the intersection of convex polyhedral cones has a non empty interior ⋮ An algorithm for least distance programming

Cites Work

• Unnamed Item

This page was built for publication: An algorithm for finding a vector in the intersection of open convex polyhedral cones