A Calculation of all Separating Hyperplanes of two Convex Polytopes

DOI10.1080/02331939708844325zbMath0880.90112OpenAlexW2075214506MaRDI QIDQ4342958

L.Grygarova

Publication date: 24 June 1997

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939708844325

zbMATH Keywords

convex analysisseparation theoremseparating hyperplane

Mathematics Subject Classification ID

Convex programming (90C25) Computational aspects related to convexity (52B55)

Related Items (6)

On the separation of parametric convex polyhedral sets with application in MOLP. ⋮ Unnamed Item ⋮ On a calculation of an arbitrary separating hyperplane of convex polyhedral sets ⋮ Separating support hyperplanes for a pair of convex polyhedral sets ⋮ Parameter spaces of separating hyperplanes ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding all vertices of a convex polyhedron
• Lineare Optimierung in unendlichdimensionalen Vektorräumen
• The Complexity of Vertex Enumeration Methods
• OnR.W. Llewellyn's rules to identify redundant constraints: A detailed critique and some generalizations
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• Zur Identifikation redundanter Nebenbedingungen in linearen Programmen
• An algorithm for determining all extreme points of a convex polytope
• Convex Analysis
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities

This page was built for publication: A Calculation of all Separating Hyperplanes of two Convex Polytopes