Polytope pairs and their relationship to linear programming

DOI10.1007/BF02392139zbMath0307.90042MaRDI QIDQ1218333

Victor Klee

Publication date: 1974

Published in: Acta Mathematica (Search for Journal in Brave)

Mathematics Subject Classification ID

Linear programming (90C05) Designs and configurations (05B99) Polytopes and polyhedra (52Bxx)

Related Items

A lower bound theorem for polytope pairs, On the complexity of computing the diameter of a polytope, How good are convex hull algorithms?, Bounds on the complexity of halfspace intersections when the bounded faces have small dimension, A method of Euclidean centers, On the complexity of d-dimensional Voronoi diagrams, The Excess Degree of a Polytope, The minimum number of faces of a simple polyhedron, A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes, The number of faces of polytope pairs and unbounded polyhedra, Rigidity and the lower bound theorem. I, Sufficiency of McMullen’s conditions for 𝑓-vectors of simplicial polytopes, Computational results on an algorithm for finding all vertices of a polytope, Stellare Abänderungen und Schälbarkeit von Komplexen und Polytopen, Expected Number of Vertices of a Random Convex Polyhedron, Gale diagrams of convex polytopes and positive spanning sets of vectors, Bounds on the number of vertices of perturbed polyhedra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph theorems for manifolds
• A comparison of primal and dual methods of linear programming
• On the number of certain types of polyhedra
• The \(d\)-step conjecture for polyhedra of dimension \(d<6\)
• Finding all vertices of a convex polyhedron
• The minimum number of vertices of a simple polytope
• On The Number of Faces of a Convex Polytope
• On the Number of Vertices of a Convex Polytope
• Historical Note on a Recurrent Combinatorial Problem
• Incidence graphs of convex polytopes
• An enumeration of simplicial 4-polytopes with 8 vertices
• Cooperative classes of finite sets in one and more dimensions
• Bounds assuring subsets in convex position
• The maximum numbers of faces of a convex polytope
• Algebraic Characterization of Some Classical Combinatorial Problems
• Shellable Decompositions of Cells and Spheres.
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
• Diameters of Polyhedral Graphs