Generating All the Faces of a Polyhedron

DOI10.1137/0126045zbMath0251.90038OpenAlexW2071727445MaRDI QIDQ5665026

C. A. Burdet

Publication date: 1974

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0126045

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

A branch and bound algorithm for extreme point mathematical programming problems, The complexity of linear programming, Inverse eigenvalue problems for linear complementarity systems, Enumerating extreme points of a highly degenerate polytope